#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

template<unsigned mod=1000000007>struct fp {
   unsigned v;
   static unsigned get_mod(){return mod;}
   unsigned inv() const{
      int tmp,a=v,b=mod,x=1,y=0;
      while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y);
      if(x<0){x+=mod;} return x;
   }
   fp():v(0){}
   fp(ll x):v(x>=0?x%mod:mod+(x%mod)){}
   fp operator-()const{return fp(-v);}
   fp pow(ll t){fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;}
   fp& operator+=(const fp& x){if((v+=x.v)>=mod)v-=mod; return *this;}
   fp& operator-=(const fp& x){if((v+=mod-x.v)>=mod)v-=mod; return *this;}
   fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;}
   fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;}
   fp operator+(const fp& x)const{return fp(*this)+=x;}
   fp operator-(const fp& x)const{return fp(*this)-=x;}
   fp operator*(const fp& x)const{return fp(*this)*=x;}
   fp operator/(const fp& x)const{return fp(*this)/=x;}
   bool operator==(const fp& x)const{return v==x.v;}
   bool operator!=(const fp& x)const{return v!=x.v;}
}; using Fp=fp<>;

template<class T>struct mat{
   int h,w; vector<vector<T>> val; T det;
   mat(){}
   mat(int n,int m):h(n),w(m),val(vector<vector<T>>(n,vector<T>(m,0))){}
   vector<T>& operator[](const int i){return val[i];}
   mat& operator+=(const mat& m){
      rep(i,0,h)rep(j,0,w)val[i][j]+=m.val[i][j];
      return *this;
   }
   mat& operator-=(const mat& m){
      rep(i,0,h)rep(j,0,w)val[i][j]-=m.val[i][j];
        return *this;
   }
   mat& operator*=(const mat& m){
      mat<T> res(h,m.w);
      rep(i,0,h)rep(j,0,m.w)rep(k,0,w)res.val[i][j]+=val[i][k]*m.val[k][j];
      *this=res; return *this;
   }
   mat operator+(const mat& m)const{return mat(*this)+=m;}
   mat operator-(const mat& m)const{return mat(*this)-=m;}
   mat operator*(const mat& m)const{return mat(*this)*=m;}
   mat pow(ll k){
      mat<T> res(h,h),c=*this; rep(i,0,h)res.val[i][i]=1;
      while(k){if(k&1)res*=c; c*=c; k>>=1;} return res;
   }
   vector<int> gauss(int c=-1){
      if(val.empty())return {};
      if(c==-1)c=val[0].size();
      int h=val.size(),w=val[0].size(),r=0;
      vector<int> res; det=1;
      rep(i,0,c){
         if(r==h)break;
         rep(j,r,h)if(val[j][i]!=0){
            swap(val[r],val[j]);
            if(r!=j)det*=-1;
            break;
         }det*=val[r][i];
         if(val[r][i]==0)continue; 
         rep(j,0,h)if(j!=r){
            T buf=val[j][i]/val[r][i];
            rep(k,i,w)val[j][k]-=val[r][k]*buf;
         } res.push_back(i); r++;
      } return res;
   }
};

int main(){
   ll n; cin>>n;
   mat<Fp> base(6,1),mul(6,6);
   base[5][0]=1;
   rep(i,0,5)mul[i][i+1]=1;
   rep(i,0,6)mul[5][i]=166666668;
   mul=mul.pow(n);
   cout<<mul[5][5].v<<endl;
   return 0;
}