#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <numeric>
#include <cstring>
#include <cmath>
#include <set>
#include <queue>
#include <stack>

const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i, n) for (int i = 0; i < (n); i++)

using namespace std;
using ll = long long int;
using P = pair<int, int>;
using edge = struct
{
    int to;
    int cost;
};

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

    ll dp[30][2][2][3];

    memset(dp, 0, sizeof(dp));

    dp[0][0][0][0] = 1;
    rep(i, P + 1)
    {
        rep(j, 2)
        {
            int lim;
            if (j == 1)
                lim = 9;
            else if (j == 0 && i == 0)
                lim = 1;
            else
                lim = 0;

                rep(k, 2) rep(l, 3) rep(d, lim + 1)
                    dp[i + 1][j || d < lim][k || d == 3][(l + d) % 3] += dp[i][j][k][l];
        }
    }

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

    printf("%lld\n", ans - 1);
}