#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;

ll power10[25] = {1};
ll dp[25][5];
ll P;

void solve() {
	rep(i, 19) power10[i + 1] = 10 * power10[i];
	dp[P][0] = 1;
	for (int i = P-1; i >= 0; i--) {
		for (int j = 0; j < 3; j++) {
			for (int k = 0; k < 10; k++) {
				if (k == 3) {
					dp[i][j] += power10[P - i - 1];
				} else {
					dp[i][j] += dp[i + 1][(k + j) % 3];
				}
			}
		}
	}
	cout << dp[0][0] - 1 << endl;
}

int main() {
	cin >> P;
	solve();
	return 0;
}