#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<complex>

#define INF (long long)1000000000
#define MOD 1000000007
#define EPS 1e-8

#define REP(i, m) for(long long i = 0; i < m; ++i)
#define FOR(i, n, m) for(long long i = n; i < m; ++i)
#define ALL(v) v.begin(), v.end()
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

ll kuri(ll a, ll n) {
	if(n==0) return 1;
	ll res = 1;
	ll buf = a;
	while(n>0) {
		if(n%2==1) {
			res *= buf;
			res = res%MOD;
		}
		buf = buf * buf;
		buf = buf % MOD;
		n /= 2;
	}
	return res;
}

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