#include <iostream>
using namespace std;
using ll = long long int;
const ll MOD = 1'000'000'007;

ll modpow(ll a, ll x){
    ll ans = 1;
    while(x > 0){
        if(x & 1){
            ans *= a;
            ans %= MOD;
        }
        a *= a;
        a %= MOD;
        x >>= 1;
    }
    return ans;
}

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