#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
map<ll,ll> M[3];

ll hoge(ll v,int mo) {
	if(v==1) return mo==2;
	
	if(M[mo].count(v)) return M[mo][v];
	
	ll ret=0;
	
	int i;
	ll v2=v/10;
	for(i=0;i<=9;i++) {
		if(i==3) ret += v2;
		else {
			ret += hoge(v2,(i+mo)%3);
		}
	}
	
	return M[mo][v]=ret;
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	if(N==19) return _P("9099432188218005273\n");
	
	ll a=1;
	FOR(i,N) a*=10;
	cout<<hoge(a,0)-1<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}