#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

ll memo[21][2][3][2];
int P;
ll rec(int i, bool lt, int sum, bool ok) {
	ll &r = memo[i+1][lt][sum][ok];
	if(r != -1) return r;
	if(i == -1) return r = ok || sum == 0 ? 1 : 0;
	int e = i == P ? 1 : 0;
	r = 0;
	rep(d, 10) if(lt || e >= d) {
		r += rec(i-1, lt || e > d, (sum + d) % 3, ok || d == 3);
	}
//	cerr << i << ", " << lt << ", " << sum << ", " << ok << " = " << r << endl;
	return r;
}

int main() {
	while(cin >> P) {
		mset(memo, -1);
		cout << rec(P, false, 0, false) - 1 << endl;
	}
	return 0;
}