#include <bits/stdc++.h>

using namespace std;
#define int long long
const int MOD = 1000000007;
void extgcd(int a, int b, int& x, int& y) {
	if (b != 0) {
		extgcd(b, a % b, y, x);
		y -= (a / b) * x;
	} else {
		x = 1;
		y = 0;
	}
}

int mod_inverse(int a, int p) {
	int x, y;
	extgcd(a, p, x, y);
	return (p + x % p) % p;
}

void add(int& a, const int& b) {
	a += b;
	if (a >= MOD) a -= MOD;
}
int N = 6;
vector<vector<int> > modmul(const vector<vector<int> >& A, const vector<vector<int> >& B) {
	vector<vector<int> > res = A;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			res[i][j] = 0;
			for (int k = 0; k < N; k++) {
				res[i][j] += A[i][k] * B[k][j];
			}
			res[i][j] %= MOD;
		}
	}
	return res;
}

vector<vector<int> > modpow(vector<vector<int> > A, int p) {
	if (p == 0) {
		vector<vector<int> > res = A;
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				res[i][j] = (i == j ? 1 : 0);
			}
		}
		return res;
	}
	vector<vector<int> > res = modpow(A, p / 2);
	res = modmul(res, res);
	if (p & 1) {
		res = modmul(res, A);
	}
	return res;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int K;
	cin >> K;
	vector<vector<int> > X(6, vector<int>(6, 0));
	for (int i = 0; i < 6; i++) {
		X[0][i] = mod_inverse(6, MOD);
	}
	for (int i = 0; i < 5; i++) {
		X[i + 1][i] = 1;
	}
	X = modpow(X, K);
	cout << X[0][0] << endl;
}