#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

#define int long long
#define MOD 1000000007

#define rep(i, n) for (int i = 0; i < (n); i++)
#define itrep(i, a) for (auto i = (a).begin(); i != (a).end(); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

signed main() {
	int N;
	cin >> N;

	if (N == 1) {
		cout << 2 << endl;
		return 0;
	}

	int ret = 4;
	int tmp = N / 2 - 1;
	int tmp2 = 5;
	rep(i, 63) {
		if ((tmp & (1LL << i))) {
			ret *= tmp2;
			ret %= MOD;
		}
		tmp2 *= tmp2;
		tmp2 %= MOD;
	}
	if (N % 2) {
		ret *= 3;
		ret %= MOD;
	}

	cout << ret << endl;

    return 0;
}