#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
  cout << (expr ? "Yes" : "No") << "\n";
}
lint power(lint x, lint n, lint mod) {
  lint ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= mod;
    (x *= x) %= mod;
    n >>= 1;
  }
  return ret;
}
vector<vector<lint>> mxm(vector<vector<lint>> a, vector<vector<lint>> b, lint mod) {
  vector<vector<lint>> ret(a.size(), vector<lint>(a.size()));
  REP(i, a.size()) {
    REP(j, a.size()) {
      REP(k, a[0].size()) {
        ret[i][j] = (ret[i][j] + a[i][k]*b[k][j] % mod) % mod;
      }
    }
  }
  return ret;
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  lint N;
  cin >> N;
  vector<vector<vector<lint>>> mat(60, vector<vector<lint>>(6, vector<lint>(6)));
  REP(i, 6) REP(j, 6) {
    if(i == 0) {
      mat[0][i][j] = power(6, MOD-2, MOD);
    } else if(i-j == 1) {
      mat[0][i][j] = 1;
    }
  }
  FOR(i, 1, 60) {
    mat[i] = mxm(mat[i-1], mat[i-1], MOD);
  }
  vector<vector<lint>> ans(6, vector<lint>(1));
  ans[0][0] = 1;
  REP(k, 60) {
    if((N>>k&1) == 1) {
      ans = mxm(mat[k], ans, MOD);
    }
  }
  cout << ans[0][0] << endl;

}