#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const int N = 15;

ll n;
ll a[N][N] = {
  0,2,2,0,0,0,0,0,0,0,1,2,0,1,1,
  0,1,2,0,0,0,0,0,0,0,0,1,0,1,1,
  1,0,0,0,1,0,1,1,0,0,0,0,0,0,0,
  0,2,2,0,0,0,0,0,0,0,1,2,0,0,1,
  1,0,0,0,0,0,1,1,0,0,0,0,0,0,0,
  0,0,0,0,0,0,0,0,1,2,0,0,1,0,0,
  0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,
  0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,
  0,0,2,0,0,0,0,0,0,0,0,0,0,1,1,
  1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,
  0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,
  0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
  0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,
  0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
  1,0,0,0,0,0,0,0,0,0,0,0,0,0,0
}, b[N][N], c[N][N];

void merge(ll (&a1)[N][N], ll (&a2)[N][N], ll (&a3)[N][N]){
  FOR(i, 0, N)FOR(j, 0, N){
    c[i][j] = 0;
    FOR(k, 0, N) c[i][j] += a1[i][k] * a2[k][j] % mod;
    c[i][j] %= mod;
  }
  FOR(i, 0, N) FOR(j, 0, N) a3[i][j] = c[i][j];
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  FOR(i, 0, N)b[i][i] = 1;
  cin >> n;
  while(n > 0){
    if(n & 1) merge(b, a, b);
    merge(a, a, a);
    n >>= 1;
  }
  cout << (b[0][0] + b[0][1] + b[0][3] + b[0][8])%mod << endl;
  return 0;
}