#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <math.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60
const double PI = 3.14159265358979323846;

ll A[30];
ll dp[30][2][2][3]; // dp[i][j][k][l]
					// j:未満   k:３が出るかどうか   l:３で割った余り

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N; N++;
	A[0] = 1;
	for (int i = 1; i < N; i++) A[i] = 0;
	dp[0][0][0][0] = 1;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 2; j++) {
			for (int k = 0; k < 2; k++) {
				for (int l = 0; l < 3; l++) {
					for (int m = 0; m <= (j ? 9 : A[i]); m++) {
						dp[i + 1][j || (m < A[i])][k || (m == 3)][(l + m) % 3] += dp[i][j][k][l];
					}
				}
			}
		}
	}

	ll ans = 0;
	for (int j = 0; j < 2; j++) {
		for (int l = 0; l < 3; l++) ans += dp[N][j][1][l];
		ans += dp[N][j][0][0];
	}
	cout << ans - 1 << endl;

	return 0;
}