#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

ll N;

vector<int> calc(ll n){
    vector<int> ans;
    while(n != 0){
        ans.push_back(n%5);
        n /= 5;
    }
    reverse(ans.begin(), ans.end());
    return ans;
}

ll dp[31][150];
ll dp2[2][31][150];

void init(){
    dp[0][0] = 1;
    ll sum = 0;
    for(int i = 1; i <= 30; i++){
        for(int j = 0; j <= 120; j++){
            for(int k = 0; k <= 4; k++){
                dp[i][j+k] += dp[i-1][j];
                sum += dp[i-1][k];
            }
        }
    }
    dp2[0][1][2] = 1;
    dp2[1][1][3] = 1;
    dp2[1][1][4] = 1;
    for(int i = 2; i <= 30; i++){
        for(int j = 0; j <= 120; j++){
            for(int k = 0; k <= 4; k++){
                dp2[1][i][j+k] += dp2[1][i-1][j];
                if(k >= 3) dp2[1][i][j+k] += dp2[0][i-1][j];
                if(k == 2) dp2[0][i][j+k] += dp2[0][i-1][j];
            }
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    cin >> N;
    ll tmp = 0;
    int cnt = 0;
    while(true){
        tmp = tmp*5+2;
        cnt++;
        if(tmp > N) break;
    }
    N += tmp;
    auto v = calc(N);
    ll ans = 0;
    int sz = v.size();
    int sum = 0;
    bool all_2 = true;
    int target = sz*2;
    for(int i = 0; i < sz; i++){
        for(int j = 0; j < v[i]; j++){
            if(all_2 && (j < 2 || v[i] == 2) ) continue;
            
            int tmp = sum+j;
            int dif = target-tmp;
            
            if(dif >= 0){
                if(all_2 && j == 2){
                    ans +=  dp2[1][sz-i-1][dif];
                }else{
                    ans += dp[sz-i-1][dif];
                }
            }
        }
        if(v[i] != 2) all_2 = false;
        sum += v[i];
    }
    if(sum == target) ans++;
    cout << ans << endl;
}