#include<bits/stdc++.h>
#define N 5
#define ll long long
using namespace std;
const ll p = 1e9+7;
struct martrix
{
    ll A[N][N];
    void init()
    {
        memset(A, 0, sizeof(A));
        A[1][2] = A[2][1] = A[2][2] = 1;
    }
    martrix operator * (martrix& a)const{
        martrix ans;
        memset(ans.A, 0, sizeof(ans.A));
        for(int i = 1; i < 3; i++)
        {
            int j = 1;
            for(int k = 1; k < 3; k++)
            {
                ans.A[i][j] += A[i][k]*a.A[k][j];
            }
            ans.A[i][j] %= p;
        }
        /*for(int i = 1; i <= 1; i++)
        {
            for(int j = 1; j <= 3; j++)
            {
                for(int k = 1; k <= 3; k++)
                {
                    ans.A[i][j] += A[i][k]*a.A[k][j];
                    ans.A[i][j] %= MOD;
                }
            }
        }*/
        return ans;
    }
    martrix ppow()const{
        martrix ans;
        memset(ans.A, 0, sizeof(ans.A));
        for(int i = 1; i < 3; i++)
        {
            for(int j = 1; j < 3; j++)
            {
                for(int k = 1; k < 3; k++)
                {
                    ans.A[i][j] += A[i][k]*A[k][j];
                }
                ans.A[i][j] %= p;
            }
        }
        return ans;
    }
};
martrix t, ans;
void qpow(ll k)
{
    t.init();
    memset(ans.A, 0, sizeof(ans.A));
    ans.A[2][1] = 1;
    while(k)
    {
        if(k&1)
        {
            ans = t*ans;
        }
        t = t.ppow();
        k >>= 1;
    }
    printf("%lld\n", ans.A[2][1]*ans.A[1][1]%p);
}
int main()
{
    freopen("fibsqr.in","r",stdin);
    freopen("fibsqr.out","w",stdout);
    ll n;
    scanf("%lld", &n);
    qpow(n);
}