#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define sca(x) scanf("%d",&x)
#define de printf("=======\n")
typedef long long ll;
using namespace std;const int maxn = 105;
typedef double Matrix[maxn][maxn];
Matrix A, X;void gauss(Matrix A,int n)
{int i,j,k,r;for(int i=0; i<n; i++){r=i;for( j=i+1; j<n; j++)if(fabs(A[j][i])>fabs(A[r][i]))r=j;if(r!=i)for(j=0; j<=n; j++)swap(A[r][j],A[i][j]);for(k=i+1; k<n; k++){double f=A[k][i]/A[i][i];for(j=i; j<=n; j++)A[k][j]-=f*A[i][j];}}for(i=n-1; i>=0; i--){for(j=i+1; j<n; j++)A[i][n]-=A[j][n]*A[i][j];A[i][n]/=A[i][i];}
}int main() {mem0(A);A[0][0]=95,A[0][1]=36,A[0][2]=11,A[0][3]=5,A[1][0]=6336,A[1][1]=2245,A[1][2]=781;A[1][3]=281,A[2][0]=781,A[2][1]=281,A[2][2]=95,A[2][3]=36,A[3][0]=2245,A[3][1]=781;A[3][2]=281,A[3][3]=95,A[0][4]=281,A[1][4]=18061,A[2][4]=2245,A[3][4]=6336;gauss(A, 4);for( int i = 0; i < 4; i++ ) {cout << A[i][4] << endl;}return 0;
}

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define sca(x) scanf("%d",&x)
#define de printf("=======\n")
typedef long long ll;
using namespace std;const ll mod = 1e9+7;
const int maxn = 4;
const int temp = 4;
const int a[4] = {36,11,5,1};
typedef struct {ll mat[maxn][maxn];void init() {mem0(mat);for( int i = 0; i < temp; i++ ) {for( int j = 0; j < temp; j++ ) {if( i == j ) mat[i][j] = 1;}}}
} Matrix;Matrix matrix = {1,5,1,-1,1,0,0,0,0,1,0,0,0,0,1,0};Matrix mul( Matrix m1, Matrix m2 ) {Matrix ret;mem0(ret.mat);for( int i = 0; i < temp; i++ ) {for( int j = 0; j < temp; j++ ) {for( int k = 0; k < temp; k++ ) {ret.mat[i][j] = (ret.mat[i][j] + (m1.mat[i][k]*m2.mat[k][j])+mod) % mod;//                cout << ret.mat[i][j] << endl;
            }}}return ret;
}Matrix matrix_quick_power( Matrix m, ll times ) {Matrix ret;ret.init();while( times ) {if( times & 1 ) ret = mul( ret, m );times >>= 1;m = mul(m, m);}return ret;
}int main() {//    debug(matrix);//    debug(matrix_quick_power( matrix, 1));
    ll n;while( cin >> n ) {if( n == 1 ) {cout << 1 << endl;}else if( n == 2 ) {cout << 5 << endl;}else if( n == 3 ) {cout << 11 << endl;}else if( n == 4 ) {cout << 36 << endl;}else {Matrix res;res.init();res = matrix_quick_power(matrix, n-4);ll ans = 0;for( int i = 0; i < 4; i++ ) {ans = (ans + res.mat[0][i]*a[i] + mod) % mod;}cout << ans << endl;}}return 0;
}