#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
map<pair<P, int>, ll> dp;
ll solve(ll l, ll r, int d){
	if(r<=6){
		ll ans=0;
		int a[7]={0, 1, 2, -1, 0, 1, 2};
		for(int i=l; i<=r; i++) if(a[i]==d) ans++;
		return ans;
	}
	if(dp.find({{l, r}, d})!=dp.end()){
		return dp[{{l, r}, d}];
	}
	ll ans=0;
	for(int i=-2; i<3; i++){
		ans+=solve((l-i+4)/5, (r-i)/5, d-i);
	}
	return dp[{{l, r}, d}]=ans;
}
int main()
{
	ll n; cin>>n;
	cout<<solve(1, n, 0)<<endl;
	return 0;
}