BestCoder Round #50 (div.2) 1003

Problem Description

ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is 1*n。ZJiaQ want to put a mook jong in a brick. because of the hands of the mook jong， the distance of two mook jongs should be equal or more than 2 bricks. Now ZJiaQ want to know how many ways can ZJiaQ put mook jongs legally(at least one mook jong).

Input

There ar multiply cases. For each case, there is a single integer n( 1 < = n < = 60)

Output

Print the ways in a single line for each case.

Sample Input

123456

Sample Output

1235812

#include <iostream>#include <cstdio>#include <cstring>#include <queue>#include <stack>#include <algorithm>#include <cmath>#define LL long long#define INF 0x3f3f3f3fusing namespace std;LL a[65] = {0,1,2,3};int main(){    int n;    for(int i=4;i<=60;i++)        a[i] = a[i-1]+ a[i-3]+1;    while(cin>>n)        cout<<a[n]<<endl;    return 0;}