#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < int(n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define repeat_from_reverse(i,m,n) for (int i = (n)-1; (i) >= int(m); --(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
typedef long long ll;
using namespace std;
template <class T> void setmax(T & a, T const & b) { if (a < b) a = b; }
template <class T> void setmin(T & a, T const & b) { if (b < a) a = b; }
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
ll bit(int i) { return 1ll << i; }
const int dy[] = { -1, 1, 0, 0 };
const int dx[] = { 0, 0, 1, -1 };
bool is_on_field(int y, int x, int h, int w) { return 0 <= y and y < h and 0 <= x and x < w; }
int main() {
    int p; cin >> p;
    vector<vector<vector<ll> > > dp = vectors(p+1, 2, 3, ll());
    dp[0][0][0] = 1;
    repeat (i,p) {
        dp[i+1][1][0] =
            + dp[i][1][0] * 4 /* 0, 3, 6, 9 */
            + dp[i][1][1] * 3 /* 2, 5, 8 */
            + dp[i][1][2] * 3 /* 1, 4, 7 */
            + dp[i][0][0]; /* 3 */
        dp[i+1][1][1] =
            + dp[i][1][0] * 3 /* 1, 4, 7 */
            + dp[i][1][1] * 4 /* 0, 3, 6, 9 */
            + dp[i][1][2] * 3 /* 2, 5, 8 */
            + dp[i][0][1]; /* 3 */
        dp[i+1][1][2] =
            + dp[i][1][0] * 3
            + dp[i][1][1] * 3
            + dp[i][1][2] * 4
            + dp[i][0][2]; /* 3 */
        dp[i+1][0][0] =
            + dp[i][0][0] * 3 /* 0, 6, 9 */
            + dp[i][0][1] * 3
            + dp[i][0][2] * 3;
        dp[i+1][0][1] =
            + dp[i][0][0] * 3 /* 0, 6, 9 */
            + dp[i][0][1] * 3
            + dp[i][0][2] * 3;
        dp[i+1][0][2] =
            + dp[i][0][0] * 3 /* 0, 6, 9 */
            + dp[i][0][1] * 3
            + dp[i][0][2] * 3;
    }
    ll ans =
        + dp[p][1][0]
        + dp[p][1][1]
        + dp[p][1][2]
        + dp[p][0][0] - 1;
    cout << ans << endl;
    return 0;
}