#include <iostream>
#include <string>
#include <cmath>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)

//桁DP
long long DP[20][2][2][3]; //pos,less,has3,mod3

long long  ketaDP(string s) {
	DP[0][0][0][0] = 1;

	int n = s.size();
	long long ans = 0;

	rep(i, n) rep(j, 2) rep(k, 2) rep(l, 3) {
		int lim = (j ? 9 : s[i] - '0');
		for (int d = 0; d <= lim; d++) {
			DP[i + 1][j || (d < lim)][k || (d == 3)][(l + d) % 3] += DP[i][j][k][l];	
		}
	}

	rep(j, 2) rep(k, 2) rep(l, 3) {
		if (k || (l == 0)) {
			ans += DP[n][j][k][l];
		}
	}

	return ans;
}

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

	cout << ketaDP(to_string((unsigned long long)pow(10, p)))-1 << endl;

	return 0;
}