#include <bits/stdc++.h>
using namespace std;
int n; long long dp[22][3];
int main() {
	cin >> n;
	dp[0][0] = 1;
	long long mul = 1;
	for(int i = 1; i <= n; i++) {
		mul *= 10;
		for(int j = 0; j < 3; j++) {
			for(int k = 0; k <= 9; k++) {
				if(k == 3) continue;
				dp[i][j] += dp[i - 1][(j - k % 3 + 3) % 3];
			}
		}
	}
	cout << (mul - 1) - (dp[n][1] + dp[n][2]) << endl;
	return 0;
}