#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll inf=1e9+7;
const ll mod=998244353;
const int MAX=200010;



signed main(){
    string s;cin>>s;
    if(s.size()==2){
        ll ans=0;
        rep(i,2){
            ans*=10;
            ans+=s[i]-'0';
        }
        ans/=3;
        ans-=3;
        cout<<ans<<endl;
        return 0;
    }
    ll m=s.size();
    vector<vector<ll> >dp(m+1,vector<ll>(2));
    dp[0][0]=1;
    rep(i,m){
        ll c=s[i]-'0';
        if(c==0){
            dp[i+1][0]+=dp[i][0];
        }else if(c<3){
            dp[i+1][1]+=dp[i][0];
        }else if(c==3){
            dp[i+1][0]+=dp[i][0];
            dp[i+1][1]+=dp[i][0];
        }else if(c<6){
            dp[i+1][1]+=dp[i][0]*2;
        }else if(c==6){
            dp[i+1][0]+=dp[i][0];
            dp[i+1][1]+=dp[i][0]*2;
        }else if(c<9){
            dp[i+1][1]+=dp[i][0]*3;
        }else{
            dp[i+1][0]+=dp[i][0];
            dp[i+1][1]+=dp[i][0]*3;
        }
        dp[i+1][1]+=dp[i][1]*4;
    }
    ll ans=dp[m][0]+dp[m][1]+14;
    cout<<ans<<endl;
}