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

#define int long long
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; }

#define MOD 1000000007

int pow_mod(int n, int m){
	int ans = 1;
	while(m > 0){
		if(m & 1) ans = (ans * n) % MOD;
		n = (n * n) % MOD;
		m >>= 1;
	}
	return ans;
}

typedef vector<int> vec;
typedef vector<vec> mat;

mat mul(mat &a, mat &b){
	mat c(a.size(), vec(b[0].size()));
	for(int i = 0;i < a.size();i++){
		for(int k = 0;k < b.size();k++){
			for(int j = 0;j < b[0].size();j++){
				c[i][j] = (c[i][j] + a[i][k]*b[k][j]%MOD) % MOD;
			}
		}
	}
	return c;
}

mat pow_mat(mat a, int n){
	mat b(a.size(), vec(a.size()));
	for(int i = 0;i < a.size();i++){
		b[i][i] = 1;
	}

	while(n > 0){
		if(n & 1) b = mul(b, a);
		a = mul(a, a);
		n >>= 1;
	}
	return b;
}

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

	int v[7] = {};
	v[0] = 1;
	for(int i = 1;i <= 6;i++){
		for(int j = 0;j < i;j++){
			v[i] += v[j]*pow_mod(6, MOD-2) % MOD;
			v[i] %= MOD;
		}
	}

	int ydk = pow_mod(6, MOD-2);

	mat a(6, vec(6));
	a[0][0] = a[0][1] = a[0][2] = a[0][3] = a[0][4] = a[0][5] = ydk;
	a[1][0] = a[2][1] = a[3][2] = a[4][3] = a[5][4] = 1;


	auto b = pow_mat(a, n); 

	if(n < 7){
		cout << v[n] << endl;
	}else{
		int ans = 0;
		for(int i = 0;i < 6;i++){
			ans = (ans + b[5][i]*v[6-i-1]%MOD)%MOD;
		}
		cout << ans << endl;
	}

	return 0;
}