Problem Description
A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.
Input
Each line will contain an integers. Process to end of file.
Output
For each case, output the result in a line.
Sample Input
100
Sample Output
4203968145672990846840663646
Note:
No generated Fibonacci
Chromium ID 计算方法
构建之法感悟
项目名称:上海地铁游
统一入口的Ajax验证
基于用户体验的服务型政府网站群建设优化方案
新技术下的政府门户网站群建设建议
国内CMS技术发展的外在表现形式
JavaScript基础 BOM
JavaScript基础 常见DOM树操作