#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int p;
string s;
ll dp[20][2][3][2];
ll dfs(int i,bool f,int sum,bool t){
	if(i==(int)s.length()){
		return (sum==0)||t;
	}
	int n=s[i]-'0';
	ll res=0;
	if(dp[i][f][sum][t]!=-1)return dp[i][f][sum][t];
	if(f){
		for(int j=0;j<n;j++){
			if(j==3){
				res+=dfs(i+1,false,(sum+j)%3,true);
			}else{
				res+=dfs(i+1,false,(sum+j)%3,t);
			}
		}
		if(n==3){
			res+=dfs(i+1,true,(sum+n)%3,true);
		}else{
			res+=dfs(i+1,true,(sum+n)%3,t);
		}
	}else{
		for(int j=0;j<=9;j++){
			if(j==3){
				res+=dfs(i+1,f,(sum+j)%3,true);
			}else{
				res+=dfs(i+1,f,(sum+j)%3,t);
			}
		}
	}
	return dp[i][f][sum][t]=res;
}
int main(){
	cin>>p;
	s.push_back('1');
	for(int i=0;i<p;i++){
		s.push_back('0');
	}
	memset(dp,-1,sizeof(dp));
	cout<<dfs(0,1,0,0)-1<<endl;
	return 0;
}