#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==v.size()?"":" ");
    return os;
}

signed main(){

    ll n;cin>>n;
    vector<int> v;
    while(n){
        int x=n%5;
        if(x<0) x+=5;
        if(x>=3) x=x-5;
        v.push_back(x);
        n=(n-x)/5;
    }

    reverse(ALL(v));

    // digit, less, plus, diff
    ll dp[30][3][3][200]={};
    dp[0][0][0][80]=1;


    // less
    auto fj=[&](int x,int put,int idx){
        if(idx) return idx;
        if(put==x) return 0;
        if(put<x) return 1;
        return 2;
    };
    auto fk=[&](int put,int idx){
        if(idx) return idx;
        if(put==0) return 0;
        if(put<0) return 2;
        return 1;
    };
    auto fl=[&](int put,int idx){
        return idx+put;
    };
    int m=(int)v.size();
    rep(i,m)rep(j,2)rep(k,2)rep(l,200){
        ll s=dp[i][j][k][l];
        int x=v[i];
        for(int put=-2;put<=2;put++){
            dp[i+1][fj(x,put,j)][fk(put,k)][fl(put,l)]+=s;
        }
    }

    cout<<dp[m][0][1][80]+dp[m][1][1][80]<<endl;
    return 0;
}