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
CF 799B T-shirt buying
Luogu P2827 蚯蚓
Luogu P4053 [JSOI2007]建筑抢修
【LGR-049】洛谷7月月赛
浅谈可持久化数据结构
CF 888E Maximum Subsequence
在平衡树的海洋中畅游(三)——Splay
浅谈单调栈/队列
CF 859E Desk Disorder