#include <bits/stdc++.h>
using namespace std;

int n;
long long dp[20][2][3];

int main()
{
	cin >> n;
	
	dp[0][0][0] = 1;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < 2; j++){
			for (int k = 0; k < 3; k++){
				for (int l = 0; l < 10; l++){
					dp[i + 1][j | l == 3][(k + l) % 3] += dp[i][j][k];
				}
			}
		}
	}
	
	long long res = dp[n][1][0] + dp[n][1][1] + dp[n][1][2] + dp[n][0][0] - 1;
	cout << res << endl;
}