#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 9;
const LL LLINF = 1e18;

LL dp[22][3][2][2];
//(桁, mod 3, contains 3, less than 10^P)

int main(void) {
	int P; cin >> P;
	const string N = "1" + string(P, '0');
	const int L = N.length();
	dp[0][0][0][0] = 1;
	REP(i, L) {
		const int D = N[i] - '0';
		REP(j, 3) REP(k, 2) REP(d, (k ? 10 : D + 1)) REP(l, 2) {
			dp[i + 1][(j + d) % 3][l || (d == 3)][k || d < D] += dp[i][j][l][k];
		}
	}
	LL ans = 0;
	REP(i, 2) REP(j, 2) ans += dp[L][0][i][j];
	REP(i, 3) REP(j, 2) ans += dp[L][i][1][j];
	REP(j, 2) ans -= dp[L][0][1][j];
	cout << ans - 1 << endl;
}