#include <iostream>
#include <vector>
#include <cstdio>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
using namespace std;

#define SZ 101
#define NUM 6

long long dp [101][101][601];
long long dp_[101][101][601];

int main(){
	//vector<vector<vector<long long>>> dp(SZ,vector<vector<long long>>(SZ,vector<long long>(100+1, 0)));	//dp[min][max][sum]

	for(int i=0; i<SZ; ++i){
		dp[i][i][i] = 1;
	}
	for(int i=1; i<NUM; i++){
		//vector<vector<vector<long long>>> dp_(SZ,vector<vector<long long>>(SZ,vector<long long>((i+1)*100+1, 0)));

		for(int min_=0;    min_<SZ; ++min_)
		for(int max_=min_; max_<SZ; ++max_)
		for(int sum=0; sum<=i*100; ++sum){
			for(int k=0; k<SZ; ++k){
				dp_[min(min_,k)][max(max_,k)][sum+k] += dp[min_][max_][sum];
			}
			dp[min_][max_][sum] = 0;
		}
		swap(dp, dp_);
	}

	vector<long long> m(401, 0);
	for(int min_=0;    min_<SZ; ++min_)
	for(int max_=min_; max_<SZ; ++max_)
	for(int sum=0; sum<=600; ++sum){
		if(dp[min_][max_][sum] > 0)
			m[sum-(min_+max_)] += dp[min_][max_][sum];
	}

	int a,b;
	scanf("%d.%d", &a,&b);
	a = (a*100+b)/25;

	printf("%lld\n", m[a]);
	//cout << m[a] << endl;
	return 0;
}