#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

ll dp[20][3][2];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int P;
    cin >> P;
    dp[0][0][0] = 1;
    for (int i = 0; i < P; i++) {
        for (int j = 0; j < 3; j++) {
            for (int k = 0; k < 2; k++) {
                if (dp[i][j][k] == 0) continue;
                for (int l = 0; l < 10; l++) {
                    int tmp = k;
                    if (l == 3) tmp = 1;
                    dp[i+1][(j+l)%3][tmp] += dp[i][j][k];
                }
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 2; j++) {
            if (i == 0 || j == 1) ans += dp[P][i][j];
        }
    }
    cout << ans-1 << endl;
    return 0;
}