#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N;
int MOD=1e9+7;

int c[2][2] = {{0,0}, {0,0}};
int R[2][2] = {
    {1,0},
    {0,1}
};
int A[2][2] = {
    {1, 1},
    {1, 0}
};
void mutmat(int a[2][2], int b[2][2]) {
    REP(i,2)REP(j,2) c[i][j]=0;
    REP(i,2)REP(j,2)REP(k,2) c[i][j]+=((a[i][k]*b[k][j])%MOD);
    REP(i,2)REP(j,2) a[i][j] = c[i][j] % MOD;
}

void solve() {
    cin>>N;
    
    REP(i,60) {
        if (N&1L<<i) {
            mutmat(R, A);
        }
        mutmat(A, A);
    }
    
    int an1 = R[0][0];
    int an = R[1][0];
    
    cout << ((an1 * an) % MOD) << endl;
}