#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define Unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
struct settings{settings(){ios_base::sync_with_stdio(0); cin.tie(0); cout<<fixed<<setprecision(15);};}settingss;
const double PI = acos(-1);
const int INF = 1001001001;
const ll LINF = 1001001001001001001LL;

const int mod = 1000000007;
class modint {
  long long x;
public:
  modint(long long x=0) : x((x%mod+mod)%mod) {}
  modint operator-() const {
    return modint(-x);
  }
  modint& operator+=(const modint& a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  modint& operator-=(const modint& a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  modint& operator*=(const  modint& a) {
    (x *= a.x) %= mod;
    return *this;
  }
  modint operator+(const modint& a) const {
    modint res(*this);
    return res+=a;
  }
  modint operator-(const modint& a) const {
    modint res(*this);
    return res-=a;
  }
  modint operator*(const modint& a) const {
    modint res(*this);
    return res*=a;
  }
  modint pow(ll t) const {
    if (!t) return 1;
    modint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  modint inv() const {
    return pow(mod-2);
  }
  modint& operator/=(const modint& a) {
    return (*this) *= a.inv();
  }
  modint operator/(const modint& a) const {
    modint res(*this);
    return res/=a;
  }
  friend ostream& operator<<(ostream& os, const modint& m){
    os << m.x;
    return os;
  }
};

// given: a_0, ..., a_k-1 and d_0, ..., d_k-1
// a_k = d_0 a_0 + d_1 a_1 + ... + d_k-1 a_k-1
template<typename T>
struct Kitamasa{
  vector<T> a;
  vector<T> d;
  int k;

  Kitamasa(vector<T>& a, vector<T>& d) : a(a), d(d), k((int)a.size()) {}

  vector<T> dfs(ll n){
    if(n == k) return d;
    vector<T> res(k);
    if(n & 1 || n < k * 2) {
      vector<T> x = dfs(n - 1);
      for(int i = 0; i < k; ++i)  res[i] = d[i] * x[k - 1];
      for(int i = 0; i + 1 < k; ++i)  res[i + 1] += x[i];
    } else {
      vector<vector<T>> x(k, vector<T>(k));
      x[0] = dfs(n >> 1);
      for(int i = 0; i + 1 < k; ++i) {
        for(int j = 0; j < k; ++j) x[i + 1][j] = d[j] * x[i][k - 1];
        for(int j = 0; j + 1 < k; ++j) x[i + 1][j + 1] += x[i][j];
      }
      for(int i = 0; i < k; ++i) {
        for(int j = 0; j < k; ++j) {
          res[j] += x[0][i] * x[i][j];
        }
      }
    }
    return res;
  }

  T calc(ll n){
    if(n < k) return a[n];
    vector<T> x = dfs(n);
    T res = 0;
    for(int i = 0; i < k; ++i)  res += x[i] * a[i];
    return res;
  }
};

int main() {
  ll N; cin >> N;
  vector<modint> a(6, 0);
  a[5] = 1;
  modint dv = 1;
  dv /= 6;
  vector<modint> d(6, dv);
  Kitamasa<modint> Kita(a, d);
  cout << Kita.calc(N+5) << endl;
}