#include <bits/stdc++.h>
#define ll long long int
#define N 101
#define mod 1000000007
using namespace std;

ll a[N][N] = {0},I[N][N];
void mul(ll A[][N], ll B[][N], ll dim)
{
    ll res[dim+1][dim+1];
    for (ll i = 0 ; i < dim; i++)
    {
        for (ll j = 0 ; j < dim; j++)
        {
            res[i][j] = 0;
            for (ll k = 0; k < dim; k++)
            {
                res[i][j] = ((res[i][j]) + (A[i][k] * B[k][j])%mod ) % mod;
            }
        }
    }

    for (ll i = 0 ; i < dim; i++)
    {
        for (ll j = 0; j < dim; j++)
        {
            A[i][j] = res[i][j];
        }
    }
}
void power(ll A[][N], ll dim, ll n)
{
    for (ll i = 0 ; i < dim; i++)
    {
        for(ll j = 0 ; j < dim;j++)
        {
            if (i == j)
                I[i][j] = 1;
            else
                I[i][j] = 0;
        }
    }

    while(n > 0)
    {
        if(n % 2)
        {
            mul(I, A,dim);
        }
        mul(A,A,dim);
        n /= 2;
    }

    for (ll i = 0 ; i < dim; i++)
        for (ll j = 0; j < dim; j++)
            A[i][j] = I[i][j];
}
int main()
{
    ll n;
    cin >> n;
    for(ll i = 0;i < 6;i++)
        a[i][5] = 1;
    a[1][0] = 1;
    a[2][1] = 1;
    a[3][2] = 1;
    a[4][3] = 1;
    a[5][4] = 1;

    power(a, 6, n-1);
    cout << 2 * a[1][0];
    return 0;
}