#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};

typedef vector<mint> vec;
typedef vector<vec> mat;

int main() {  
  ll n;
  cin >> n;

  mat m(6, vec(6, 0));
  vec dp(6, 0);
  mint p = mint(1) / 6;
  dp[0] = 1;

  for (int i = 0; i < 6; i++) m[0][i] = p;
  for (int i = 1; i < 6; i++) m[i][i - 1] = 1;

  auto update = [&](mat A){
    vec ndp(6, 0);
    for (int i = 0; i < 6; i++) {
      for (int j = 0; j < 6; j++) ndp[i] += A[i][j] * dp[j];
    }
    dp = ndp;
  };

  auto mul_mat = [&](mat A, mat B){
    mat res(6, vec(6, 0));
    for (int i = 0; i < 6; i++) {
      for (int j = 0; j < 6; j++) {
        for (int k = 0; k < 6; k++) res[i][j] += A[i][k] * B[k][j];
      }
    }
    return res;
  };

  ll k = n;
  
  while (k) {
    if (k & 1) update(m);
    m = mul_mat(m, m);
    k >>= 1;
  }
  
  
  cout << dp[0].x << endl;

  return 0;
}