#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define mod 1000000007

using namespace std;
typedef pair<llint, llint> P;

llint n;
llint a[30];
llint beki[30];
llint dp[28][120][2][2];
llint zero = 60;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	beki[0] = 1;
	for(int i = 1; i <= 26; i++) beki[i] = beki[i-1] * 5;
	
	for(int i = 0; i <= 26; i++) n += beki[i] * 2;
	for(int i = 0; i <= 26; i++){
		a[i] = n % 5;
		n /= 5;
	}
	
	dp[27][zero][0][0] = 1;
	for(int i = 27; i > 0; i--){
		for(int j = 0; j < 120; j++){
			for(int k = 0; k < 2; k++){
				for(int l = 0; l < 2; l++){
					for(int m = 0; m < 5; m++){
						llint nj = j, nk = k, nl = l;
						if(k == 0 && m > a[i-1]) continue;
						if(m < a[i-1]) nk = 1;
						if(l == 0 && m < 2) continue;
						if(m > 2) nl = 1;
						nj += m-2;
						if(nj >= 0 && nj < 120) dp[i-1][nj][nk][nl] += dp[i][j][k][l];
					}
				}
			}
		}
	}
	llint ans = dp[0][zero][0][1] + dp[0][zero][1][1];
	cout << ans << endl;
	
	return 0;
}