bzoj2660

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int N = 110;
int top;
long long n;
long long f[N], dp[N][2], st[N];
int main()
{
    cin >> n;
    f[1] = 1;
    f[2] = 2;
    for(int i = 3; i <= 88; ++i) f[i] = f[i - 1] + f[i - 2];
    for(int i = 88; i; --i) if(n - f[i] >= 0) 
    {
        n -= f[i];
        st[++top] = i;
    }
    reverse(st + 1, st + top + 1);
    dp[1][1] = 1;
    dp[1][0] = (st[1] - 1) >> 1;
    for(int i = 2; i <= top; ++i)
    {
        dp[i][1] = dp[i - 1][0] + dp[i - 1][1];
        dp[i][0] = dp[i - 1][0] * ((st[i] - st[i - 1]) >> 1) + dp[i - 1][1] * ((st[i] - st[i - 1] - 1) >> 1);
    }
    cout << dp[top][0] + dp[top][1];
    return 0;
}