#include #include #include #include #define MOD 1000000007 using namespace std; long long n, ans; long long quickPow(long long a, long long n) { long long res = 1; while (n > 0) { if (n & 1) { res = (res * a) % MOD; n--; } else { n /= 2; a = (a * a) % MOD; } } return res; } void input() { freopen("robots.in", "r", stdin); scanf("%lld", &n); fclose(stdin); } void calculate() { long long ans1 = quickPow(3, (n * (n - 1)) / 2) % MOD, ans2 = quickPow(2, n) % MOD; ans = (ans1 * ans2) % MOD; } void output() { freopen("robots.out", "w", stdout); printf("%lld\n", ans); fclose(stdout); } int main() { input(); calculate(); output(); return 0; }