#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }


int main() {
	double Xx;
	while(cin >> Xx) {
		int X = (int)(Xx * 100 + .5);
		ll ans = 0;
		if(X % 25 != 0) {
			ans = 0;
		} else {
			int sum = X * 4 / 100;
			vector<vector<ll>> dp(601, vector<ll>(101 * 101));
			dp[0][100 * 101 + 0] = 1;
			rep(k, 6) {
				for(int j = k * 100; j >= 0; -- j) rer(mi, 0, 100) rer(ma, 0, 100) {
					ll x = dp[j][mi * 101 + ma];
					if(x == 0) continue;
					dp[j][mi * 101 + ma] = 0;
					rer(a, 0, 100)
						dp[j + a][min(mi, a) * 101 + max(ma, a)] += x;
				}
			}
			rer(mi, 0, 100) rer(ma, 0, 100) {
				ans += dp[sum + mi + ma][mi * 101 + ma];
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}