#include <cstdio>
#include <cstdlib>
#include <cstddef>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <iostream>
#include <iomanip>

#define ASDF (1000000007)

long modpow(long src, long pow, long mod)
{
	long res = 1;
	while (0 < pow) {
		if (pow % 2 == 1) {
			res = (res * src) % mod;
			pow--;
		}
		src = (src * src) % mod;
		pow /= 2;
	}
	return res;
}

int main(void)
{
	long n;
	std::cin >> n;
    if(n == 1){
        std::cout << 2 << std::endl;
    } else if(n == 2){
        std::cout << 4 << std::endl;
    } else if(n == 3){
        std::cout << 12 << std::endl;
    } else {
        long tot = 1 + (n % 2) * 2;//1(even) or 3(odd)
        // tot * 4 * 5^([n/2] - 1)
        tot *= 4;
        long cnt = n / 2 - 1;
        tot = (tot * modpow(5, cnt, ASDF)) % ASDF;
        std::cout << tot << std::endl;
    }
	return 0;
}