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

#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int MOD = 1e9 + 7;
const ll INF = LLONG_MAX / 2;

int pow_mod(ll x, ll n, int M) {
	ll ans = 1;
	for (; n; n>>=1) {
		if (n & 1) ans = ans * x % M;
		x = x * x % M;
	}
	return ans;
}

int main() {
	ll n; cin >> n;
	if (n == 1) {
		cout << 2 << endl;
		return 0;
	}
	ll ans = 1;
	if (n % 2) ans = 3;
	ans = ans * 4;
	ans = ans * pow_mod(5, n / 2 - 1, MOD) % MOD;
	cout << ans << endl;
}