#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;


inline double Mod(double v,double mod=MOD){
  return v;
}
inline ll Mod(ll v,ll mod=MOD){
  return v%mod;
}
typedef vector<vector<ll> > matl;
typedef vector<vector<double> > matd;
template<class T> vector<T> operator*(const T &a,vector<T> v){
  rep(i,v.size())
    v[i]=Mod(v[i]*a);
  return v;
}
template<class T> vector<T> operator+(vector<T> v,const vector<T> &w){
  rep(i,v.size())
    v[i]=Mod(v[i]+w[i]);
  return v;
}
template<class T> vector<vector<T> > matE(T n){
  vector<vector<T> > re(n,vector<T>(n));
  rep(i,n)
    re[i][i]=1;
  return re;
}
template<class T>vector<vector<T> >matE(vector<vector<T> >mat){
  return matE((T)(mat.size()));
}

template<class T>
vector<vector<T> > transpose(const vector<vector<T> > &a,
vector<vector<T>> &re){
  re.resize(a[0].size(),vector<T>(a.size()));
  rep(i,a[0].size())
    rep(j,a.size())
      re[i][j]=a[j][i];
  return re;
}

template<class T> T operator*(const vector<T> &a,
		     const vector<T> &b){
  T re=0;
  rep(i,a.size())
    re=Mod(re+Mod(a[i]*b[i]));
  return re;
}
template<class T> vector<vector<T> >
operator*(const vector<vector<T> > &a
,const vector<vector<T> > &b_){
  vector<vector<T> > b;
  transpose(b_,b);
  vector<vector<T> > re(a.size(),vector<T>(b.size()));
  rep(i,a.size())
    rep(j,b.size())
      re[i][j]=a[i]*b[j];
  return re;
}
template<class T>
vector<vector<T> > pow(vector<vector<T> > a,ll n){
  vector<vector<T> > re;
  if(n==0)
    return matE(a);
  re=pow(a,n/2);
  return re*re*(n%2?a:matE(a));
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  matl A(10,vector<ll>(10));
  reps(i,0,10) A[i][i]=1;
  reps(i,1,9)if(i!=5) A[9][i]=1;
  reps(i,1,8) A[i][0]=1;
  A[8][7]=1;
  reps(i,1,8)rep(j,8)if(i&j && !(i==5) && j!=5) A[i][j]=1;
  A[7][5]=A[5][5]=1;
  A[1][8]=A[4][8]=1;
  A[5][1]=A[5][4]=1;
  ll n;
  cin>>n;
  matl B=pow(A,n+1);
  //out(A,B,1);
  cout<<B[9][0]<<endl;
  return 0;
}