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

const ll mod = 1000000007;

ll powMod(ll N) {
    ll n = N / 2;
    ll ans = 5;
    ll x = 1;
    while (x * 2 < n - 1) {
        ans = ans * ans % mod;
        x *= 2;
    }
    for (ll i = 0; i < n - 1 - x; i++) {
        ans = ans * 5 % mod;
    }
    ans = ans * 4 % mod;
    if (N % 2 == 1) {
        ans = ans * 3 % mod;
    }
    return ans;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll N;
    cin >> N;

    if (N == 1) {
        cout << 2 << endl;
        return 0;
    } else if (N == 2) {
        cout << 4 << endl;
        return 0;
    } else if (N == 3) {
        cout << 12 << endl;
        return 0;
    }

    cout << powMod(N) << endl;

    return 0;
}