#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

template<typename K>
struct Matrix{
  typedef vector<K> arr;
  typedef vector<arr> mat;
  mat dat;

  Matrix(size_t r,size_t c):dat(r,arr(c,K())){}
  Matrix(mat dat):dat(dat){}

  size_t size() const{return dat.size();};
  bool empty() const{return size()==0;};
  arr& operator[](size_t k){return dat[k];};
  const arr& operator[](size_t k) const {return dat[k];};
  
  static Matrix cross(const Matrix &A,const Matrix &B){
    Matrix res(A.size(),B[0].size());    
    for(int i=0;i<(int)A.size();i++)
      for(int j=0;j<(int)B[0].size();j++)
        for(int k=0;k<(int)B.size();k++)
          res[i][j]+=A[i][k]*B[k][j];
    return res;
  }

  static Matrix identity(size_t n){
    Matrix res(n,n);
    for(int i=0;i<(int)n;i++) res[i][i]=K(1);
    return res;
  }
  
  Matrix pow(long long n) const{
    Matrix a(dat),res=identity(size());
    while(n){
      if(n&1) res=cross(res,a);
      a=cross(a,a);      
      n>>=1;
    }
    return res;
  }

  template<typename T> using ET = enable_if<is_floating_point<T>::value>;
  template<typename T> using EF = enable_if<!is_floating_point<T>::value>;
  
  template<typename T, typename ET<T>::type* = nullptr>
  static bool is_zero(T x){return abs(x)<1e-8;}
  template<typename T, typename EF<T>::type* = nullptr>
  static bool is_zero(T x){return x==T(0);}

  static Matrix gauss_jordan(const Matrix &A,const Matrix &B){
    int n=A.size(),l=B[0].size();
    Matrix C(n,n+l);
    for(int i=0;i<n;i++){
      for(int j=0;j<n;j++)
        C[i][j]=A[i][j];      
      for(int j=0;j<l;j++)
        C[i][n+j]=B[i][j];
    }
    for(int i=0;i<n;i++){
      int p=i;
      for(int j=i;j<n;j++)
        if(abs(C[p][i])<abs(C[j][i])) p=j;
      swap(C[i],C[p]);
      if(is_zero(C[i][i])) return Matrix(0,0);
      for(int j=i+1;j<n+l;j++) C[i][j]/=C[i][i];
      for(int j=0;j<n;j++){
        if(i==j) continue;
        for(int k=i+1;k<n+l;k++)
          C[j][k]-=C[j][i]*C[i][k];
      }
    }
    Matrix res(n,l);
    for(int i=0;i<n;i++)
      for(int j=0;j<l;j++)
        res[i][j]=C[i][n+j];
    return res;
  }
  
  Matrix inv() const{
    Matrix B=identity(size());
    return gauss_jordan(*this,B);
  }
  
  K determinant() const{
    Matrix A(dat);
    K res(1);
    int n=size();
    for(int i=0;i<n;i++){
      int p=i;
      for(int j=i;j<n;j++)
        if(abs(A[p][i])<abs(A[j][i])) p=j;      
      if(i!=p) swap(A[i],A[p]),res=-res;      
      if(is_zero(A[i][i])) return K(0);      
      res*=A[i][i];
      for(int j=i+1;j<n;j++) A[i][j]/=A[i][i];
      for(int j=i+1;j<n;j++)
        for(int k=i+1;k<n;k++)
          A[j][k]-=A[j][i]*A[i][k];
    }
    return res;
  }

  static arr linear_equations(const Matrix &A,const arr &b){
    Matrix B(b.size(),1);
    for(int i=0;i<(int)b.size();i++) B[i][0]=b[i];
    Matrix tmp=gauss_jordan(A,B);
    arr res(tmp.size());
    for(int i=0;i<(int)tmp.size();i++) res[i]=tmp[i][0];
    return res;
  }
  
  static K sigma(K x,long long n){
    Matrix A(2,2);
    A[0][0]=x;A[0][1]=0;
    A[1][0]=1;A[1][1]=1;
    return A.pow(n)[1][0];
  }
};


template<typename T,T MOD = 1000000007>
struct Mint{
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }
  
  Mint inv(){return pow(MOD-2);}
  
  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}
  
  Mint operator+(Mint a) const{return Mint(v)+=a;};
  Mint operator-(Mint a) const{return Mint(v)-=a;};
  Mint operator*(Mint a) const{return Mint(v)*=a;};
  Mint operator/(Mint a) const{return Mint(v)/=a;};

  Mint operator-(){return v?MOD-v:v;}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  
  bool operator<(const Mint a)const{return v<a.v;}
};

//INSERT ABOVE HERE
signed main(){
  using M = Mint<int>;
  using MM = Matrix<M>;

  const int S = 27;
  MM A(S,S);
  for(int i=0;i<S;i++)
    for(int j=0;j<S;j++)
      A[i][j]=M(0);

  auto idx=[&](int x,int y,int z){return x*9+y*3+z;};
  for(int i=0;i<3;i++){
    for(int j=0;j<3;j++){
      for(int k=0;k<3;k++){
        for(int a=0;a<2;a++){
          for(int b=0;b<2;b++){
            for(int c=0;c<2;c++){
              for(int d=0;d<2;d++){
                for(int e=0;e<2;e++){
                  if(i==0&&a==0) continue;
                  if(j==0&&b==0) continue;
                  if(k==0&&c==0) continue;
                
                  if(i==2&&a==1) continue;
                  if(j==2&&b==1) continue;
                  if(k==2&&c==1) continue;

                  if(a==1&&d==1) continue;
                  if(b==1&&d==1) continue;
                  if(b==1&&e==1) continue;
                  if(c==1&&e==1) continue;

                  if(d==1&&e==1) continue;

                  int ni=(i==2)||a,nj=(j==2)||b,nk=(k==2)||c;
                  if(ni==0&&nj==0) continue;
                  if(nj==0&&nk==0) continue;
                  
                  int x=(a||d)*2,y=(b||d||e)*2,z=(c||e)*2;                  
                  if(x==0&&i==2) x=1;                 
                  if(y==0&&j==2) y=1;                 
                  if(z==0&&k==2) z=1;                

                  A[idx(x,y,z)][idx(i,j,k)]+=M(1);
                }
              }
            } 
          } 
        }          
      }
    }
  }
  
  MM C(S,1);
  for(int i=0;i<S;i++) C[i][0]=M(0);
  C[idx(2,2,2)][0]=M(1);
  
  Int n;
  cin>>n;
  auto B=MM::cross(A.pow(n),C);
  
  M ans(0);
  for(int i=1;i<3;i++){
    for(int j=1;j<3;j++){
      for(int k=1;k<3;k++){
        if(i==1&&j==1) continue;
        if(j==1&&k==1) continue;
        ans+=B[idx(i,j,k)][0];
      }
    }
  }
  cout<<ans.v<<endl;
  return 0;
}