#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> pippi;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
int iinf=1<<30;
double pi=3.141592653589793238462643383279L;
double eps=1e-8;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
//#define endl "\n"
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<int,int,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    if(k<0)return 0;
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
 vector<vector<ll>> matmul(vector<vector<ll>> a,vector<vector<ll>> b,ll md){
    ll n=a.size();
    vector<vector<ll>> ret;
    vector<ll> e;
    rep(i,0,n)e.push_back(0);
    rep(i,0,n)ret.push_back(e);
    rep(i,0,n){
        rep(j,0,n){
            ll sum=0;
            rep(k,0,n){
                sum+=(a[i][k]*b[k][j])%md;
                sum%=md;
            }
            ret[i][j]=sum;
        }
    }
    return ret;
}
vector<vector<ll>> matbeki(vector<vector<ll>> a,ll n,ll md){
    vector<vector<ll>> ret;
    ll m=a.size();
    vector<ll> e;
    rep(i,0,m)e.push_back(0);
    rep(i,0,m)ret.push_back(e);
    rep(i,0,m){
        rep(j,0,m){
            if(i==j)ret[i][j]=1;
            else ret[i][j]=0;
        }
    }
    
    while(n>0){
        if(n%2){
            ret=matmul(ret,a,md);
            
        }
        a=matmul(a,a,md);
        n/=2;
    }
    return ret;
}
vector<ll> f(ll n){
    vector<ll> ret;
    
    while(n>0){
       // if(n==4)cout<<m<<" "<<ret<<endl;
        ll r=n%5;
        if(r<=2){
            ret.push_back(r);
            n-=r;
        }
        else{
            ret.push_back(r-5);
            n+=5-r;
        }
        n/=5;
    }
    reverse(ret.begin(),ret.end());
    return ret;
}

int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll n;cin>>n;
    vector<ll> v=f(n);
    ll m=v.size();
    ll dp[m+1][2][2][2*m+3][2*m+3];
    memset(dp,0,sizeof dp);
    dp[0][1][1][0][0]=1;
    rep(i,0,m){
        rep(j,0,2){
            rep(k,0,2){
                rep(l,0,2*m+1){
                    rep(ii,0,2*m+1){
                        if(j==0){
                            if(k==0){
                                rep(jj,-2,3){
                                    if(jj<0){
                                        dp[i+1][0][0][l-jj][ii]+=dp[i][j][k][l][ii];
                                    }
                                    else{
                                        dp[i+1][0][0][l][ii+jj]+=dp[i][j][k][l][ii];
                                    }
                                }
                            }
                            else{
                                rep(jj,1,3){
                                    dp[i+1][0][0][l][ii+jj]+=dp[i][j][k][l][ii];
                                }
                                dp[i+1][0][1][l][ii]+=dp[i][j][k][l][ii];
                            }
                        }
                        else{
                            if(k==0){
                                rep(jj,-2,v[i]){
                                    if(jj<0){
                                        dp[i+1][0][0][l-jj][ii]+=dp[i][j][k][l][ii];
                                    }
                                    else{
                                        dp[i+1][0][0][l][ii+jj]+=dp[i][j][k][l][ii];
                                    }
                                }
                                if(v[i]<0)dp[i+1][1][0][l-v[i]][ii]+=dp[i][j][k][l][ii];
                                else dp[i+1][1][0][l][ii+v[i]]+=dp[i][j][k][l][ii];
                            }
                            else{
                                if(v[i]<0)continue;
                                rep(jj,1,v[i]){
                                    dp[i+1][0][0][l][ii+jj]+=dp[i][j][k][l][ii];
                                }
                                if(v[i]==0){
                                    dp[i+1][1][1][l][ii]+=dp[i][j][k][l][ii];
                                }
                                else{
                                    dp[i+1][0][1][l][ii]+=dp[i][j][k][l][ii];
                                    dp[i+1][1][0][l][ii+v[i]]+=dp[i][j][k][l][ii];
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    ll ans=0;
    rep(i,0,2){
        rep(j,0,2){
            rep(k,0,2*m+1){
                ans+=dp[m][i][j][k][k];
            }
        }
    }
    cout<<ans-1<<endl;
}