#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7/*998244353*/;
const ll INF = 1LL << 60;
ll mod_pow(ll, ll, ll); ll mod_fact(ll, ll); ll mod_inv(ll, ll); ll gcd(ll, ll); ll lcm(ll, ll);
//
int main(){
    int p;
    cin >> p;
    vector<vector<vector<ll>>> dp(p + 1, vector<vector<ll>>(2, vector<ll>(3)));
    dp[0][0][0] = 1;
    for(int i = 0; i < p; i++){
        for(int j = 0; j < 2; j++){
            for(int k = 0; k < 3; k++){
                for(int n = 0; n <= 9; n++){
                    dp[i + 1][j || (n == 3)][(k + n) % 3] += dp[i][j][k];
                }
            }
        }
    }
    /*for(int i = 0; i <= p; i++){
        cout << "\n";
        for(int j = 0; j < 2; j++){
            cout << "\n";
            for(int k = 0; k < 3; k++){
                cout <<  dp[i][j][k] << " ";
            }
        }
    }*/
    cout << dp[p][0][0] + dp[p][1][0] + dp[p][1][1] + dp[p][1][2] - 1 << "\n";
}