#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

ll dp[20][3][2]; // pos, mod 3, used 3

int main() {
    int P;
    cin >> P;

    dp[0][0][0] = 1;

    rep (i, P) {
        rep (j, 3) {
            rep (k, 2) {
                rep (l, 10) {
                    dp[i + 1][(j + l) % 3][k || (l == 3)] += dp[i][j][k];
                }
            }
        }
    }

    ll ans = 0;
    rep (j, 3) rep (k, 2) {
        if (j == 0 || k) {
            ans += dp[P][j][k];
        }
    }

    cout << ans - 1 << endl;
}