#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

// index nz lt  th cmod
ll dp[22][2][2][2][3];

int main(void){
	int P;
	cin >> P;
	string number="1";
	rep(i,P) number+="0";
	int n=number.size();
	dp[0][0][0][0][0]=1LL;
	rep(i,n)rep(nz,2)rep(lt,2)rep(th,2)rep(cmod,3){
		rep(d,10){
			int cur=number[i]-'0';
			int nnz=nz; if(d) nnz=1;
			int nlt=lt; if(nlt==0&&d<cur) nlt=1;
			if(nlt==0&&d>cur) break;
			int nth=th; if(d==3) nth=1;
			int nmod=(10*cmod+d)%3;
			dp[i+1][nnz][nlt][nth][nmod]+=dp[i][nz][lt][th][cmod];
		}
	}
	ll ans=0LL;
	rep(lt,2){
		ans+=dp[n][1][lt][0][0];
		rep(cmod,3) ans+=dp[n][1][lt][1][cmod];
	}
	cout << ans << endl;
	return 0;
}