#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define FOR(i,n) for(int i = 0;i<n;i++)
#define rep(i,s,n) for(int i = s;i<n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
const ll MOD=1000000007,INF=1ll<<60;
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};
typedef pair<int,pint>P2;
typedef vector<vint>vvint;

string s="";
int dp[30][2][2][3];
 
signed main() {
    IOS();
    int P;
    cin>>P;
    s=s+'1';
    rep(i,0,P){
        s=s+'0';
    }
    
    int N=(int)s.size();
    dp[0][0][0][0]=1;
    rep(i,0,N){
        rep(j,0,2){
            int lim=j?9:s[i]-'0';
            rep(k,0,2){
                rep(l,0,3)rep(d,0,lim+1){
                    dp[i+1][j||d<lim][k||d==3][(d+l)%3]+=dp[i][j][k][l];
                }
            }
        }
    }
    
    int ans=0;
    rep(k,0,2)rep(d,0,3){
        if(k||d==0){
            ans+=dp[N][0][k][d];
            ans+=dp[N][1][k][d];
        }
    }
    cout<<ans-1<<endl;
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    return 0;
}