#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;
typedef long double ld;

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 (a>b) { a=b; return 1; } return 0; }

const ll MOD = 1e9 + 7;

ll modpow(ll a, ll b){
	if(b == 0) return 1;
	if(b % 2 == 1) return a * modpow(a, b - 1) % MOD;

	ll d = modpow(a, b / 2) % MOD;
	return d * d % MOD;
}

typedef vector<vector<ll>> mat;

void print(mat A){
	rep(i, A.size()){
		rep(j, A[i].size()){
			cout << A[i][j] << (j == A[i].size()-1 ? "\n" : " ");
		}
	}
}

mat mmul(mat A, mat B){
	int n = A.size();
	int l = A[0].size();
	int m = B[0].size();
	mat C(n, vector<ll>(m, 0));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			for(int k = 0; k < l; k++){
				C[i][j] += A[i][k] * B[k][j];
				C[i][j] %= MOD;
			}
		}
	}

	return C;
}

mat mE(int n){
	mat A(n, vector<ll>(n, 0));
	for(int i = 0; i < n; i++){
		A[i][i] = 1LL;
	}

	return A;
}

mat mpow(mat A, ll x){
	int n = A.size();
	if(x == 0) return mE(n);
	if(x % 2 == 1) return mmul(A, mpow(A, x - 1));

	mat B = mpow(A, x / 2);
	return mmul(B, B);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll n;
	cin >> n;

	vector<ll> p(7, 0);
	
	ll d = modpow(6ll, MOD - 2);
	p[1] = d;
	ll sm = p[1];
	rep(i, 5){
		p[i+2] = d * sm % MOD + d;
		p[i+2] %= MOD;
		sm += p[i+2];
		sm %= MOD;
	}

	if(n <= 6){
		cout << p[n] << endl;
	}else{
		mat A = vector<vector<ll>>(6, vector<ll>(6));
		rep(j, 6) A[0][j] = d;
		for(int i = 1; i < 6; i++){
			rep(j, 6) A[i][j] = (j == i - 1 ? 1 : 0);
		}

		mat x = vector<vector<ll>>(6, vector<ll>(1));
		rep(i, 6) x[i][0] = p[6 - i];

		cout << mmul(mpow(A, n - 6), x)[0][0] << endl;
	}

}