#include <stdio.h>

#define M 20

const int mod = 1000000007;

int dp[2][M][M];

const int T[M][M] = {
{1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 3, 4, 5, 3, 4, 3, 6, 0, 0},
{0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 2, 3, 4, 0, 0, 0, 5, 0, 1},
{0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 3, 2, 3, 3, 4, 0, 0, 0, 2},
{0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 4, 3, 2, 4, 3, 4, 0, 5, 3},
{0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 3, 4, 2, 3, 0, 0, 0, 1},
{0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 4, 3, 3, 2, 3, 0, 0, 2},
{0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 4, 0, 3, 2, 5, 0, 1},
{0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0},
{0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 3, 0, 0, 0, 0, 3, 0, 4, 2},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},
};

void mult(const int A[M][M], const int B[M][M], int C[M][M]){
  int i, j, k;
  for(i=0;i<M;i++){
    for(j=0;j<M;j++){
      long long int tmp = 0;
      for(k=0;k<M;k++){
        tmp = (tmp + (long long int) A[i][k] * B[k][j]) % mod;
      }
      C[i][j] = tmp;
    }
  }
}

void modpow(long long int n, int A[2][M][M]){
  int i, j;
  int tmp[2][M][M];
  int b = 0;
  int c = 0;
  for(i=0;i<M;i++){
    for(j=0;j<M;j++){
      tmp[0][i][j] = i == j;
    }
  }

  while(n){
    if(n&1) mult(tmp[b], A[c], tmp[b^1]), b^=1;
    mult(A[c], A[c], A[c^1]), c^=1;
    n /= 2;
  }

  for(i=0;i<M;i++){
    for(j=0;j<M;j++){
      A[0][i][j] = tmp[b][i][j];
    }
  }
}


int main(){
  int i, j;
  long long int n;
  scanf("%lld", &n);

  for(i=0;i<M;i++){
    for(j=0;j<M;j++){
      dp[0][i][j] = T[i][j];
    }
  }

  modpow(n+1, dp);

  printf("%d\n", dp[0][0][19]);
  return 0;
}