#include <stdio.h>

#define M 12

const int mod = 1000000007;

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

const int T[M][M] = {
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,   -4},
{1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,   -4},
{0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,   39},
{0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0,   -56},
{0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0,  -62},
{0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0,  386},
{0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0,  -753},
{0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,  884},
{0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -685},
{0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,  342},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0,  -102},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,   16},
};


const int s[M] = {
  32, 316, 2292, 14422, 84744, 479004, 2638328, 14258574, 75940592, 399782668, 84795558, 786749020
};


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, ans;
  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];
    }
  }

  if(n <= M){
    printf("%d\n", s[n-1]);
    return 0;
  }
  modpow(n-M, dp);
  ans = 0;
  for(i=0;i<M;i++){
    ans = (ans + (long long) s[i] * dp[0][i][M-1]) % mod;
  }

  printf("%d\n", ans);
  return 0;
}