#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
vl trans(ll x,ll d){
    vl v(d);
    per(i,d){
        v[i]=x%5;
        x/=5;
    }
    return v;
}
int main(){
    ll n;cin >> n;
    ll t=1;
    ll r=n,l=0;
    ll d=0;
    rep(_,100){
        d++;
        t*=5;
        r+=t/5*2;
        l+=t/5*2;
        if(t/2>=n)break;
    }
    auto solve=[&](auto &self,vl x) -> ll{
        vector<vvl> dp(d+1,vvl(d*5,vl(2)));//今見てる桁、桁和、smallerか
        dp[0][0][0]=1;
        rep(i,d){
            rep(j,d*5){
                if(j+x[i]<d*5)dp[i+1][j+x[i]][0]+=dp[i][j][0];
                rep(k,x[i]){
                    if(j+k<d*5){
                        dp[i+1][j+k][1]+=dp[i][j][0];
                    }
                }
                rep(k,5){
                    if(j+k<d*5){
                        dp[i+1][j+k][1]+=dp[i][j][1];
                    }
                }
            }
        }
        return dp[d][d*2][0]+dp[d][d*2][1];
    };
    vl nr=trans(r,d);
    vl nl=trans(l,d);
    cout << solve(solve,nr)-solve(solve,nl) << endl;
}