#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;

int main()
{
    ll n;
    cin >> n;
    if(n == 1)
    {
        cout << 2 << endl;
        return 0;
    }
    if(n == 2)
    {
        cout << 4 << endl;
        return 0;
    }
    ll p = 4;
    ll m = n - 2;
    if(n % 2 == 1)
    {
        p = 12;
        m--;
    }
    m /= 2;
    vector<ll> v;
    v.reserve(1e6);
    ll d = 5;
    while(m > 0)
    {
        const ll mod = 1000000007;
        v.push_back(d);
        if(m & 1)
        {
            p *= d;
            p %= mod;
        }
        m >>= 1;
        d *= d;
        d %= mod;
    }
    cout << p << endl;
    return 0;
}