// yukicoder: No.557 点対称
// 2019.5.12 bal4u

#include <stdio.h>

#define M 1000000007

int bigpow(int x, int p)
{
	int r = 1;
	if (p <= 0) return 1;
	while (p) {
		if (p & 1) r = (long long)r * x % M;
		x = (long long)x * x % M;
		p >>= 1;
	}
	return r;
}

int main()
{
	int ans;
	long long N;
	
	scanf("%lld", &N);
	if (N == 1) ans = 2;
	else {
		ans = 4; if (N & 1) ans = 12;
		ans = (long long)ans * bigpow(5, (int)(((N>>1)-1) % (M-1))) % M;
	}
	printf("%d\n", ans);
	return 0;
}