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

const ll mod = 1000000007;

ll powMod(ll N) {
    ll result = 1;
    ll a = 5;
    ll n = N / 2 - 1;
    while (n > 0) {
        if (n % 2 == 1) {
            result = result * a % mod;
        }
        a = a * a % mod;
        n /= 2;
    }
    return result;
}

ll solve(ll N) {
    ll ans = powMod(N);
    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;
    }

    cout << solve(N) << endl;

    return 0;
}