#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

ll n;

ll A[27][27];
ll tmp[27][27];
ll r[27][27];

#define UNPACK(a,b,c,x) int a=(x)%3, b=((x)/3)%3, c=(x)/9

void matmul(ll r[27][27], ll a[27][27], ll b[27][27]){
  REP(i,27)REP(j,27)tmp[i][j] = 0;
  REP(i,27)REP(j,27)REP(k,27)(tmp[i][j] += a[i][k] * b[k][j] % MOD) %= MOD;
  REP(i,27)REP(j,27)r[i][j] = tmp[i][j];
}

int main(){
  REP(i,27){
    UNPACK(a,b,c,i);
    REP(j,27){
      UNPACK(x,y,z,j);
      // has space
      if(x==0 && y==0)continue;
      if(y==0 && z==0)continue;
      if(a==0 && x==0)continue;
      if(b==0 && y==0)continue;
      if(c==0 && z==0)continue;
      // not connect check
      if(a==1 && x!=2)continue;
      if(b==1 && y!=2)continue;
      if(c==1 && z!=2)continue;
      // 2 put check
      bool conx = a!=1 && x==2;
      bool cony = b!=1 && y==2;
      bool conz = c!=1 && z==2;
      if(conx && cony && conz)continue;
      if(conx && !cony)continue;
      if(cony && !conx && !conz)continue;
      if(conz && !cony)continue;
      // ok
      A[j][i] = 1;
    }
  }
  REP(i,27)r[i][i] = 1;
  cin>>n;
  n++;
  while(n){
    if(n&1)matmul(r,r,A);
    matmul(A,A,A);
    n>>=1;
  }
  printf("%lld\n", r[13][26]);
  return 0;
}