#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)

string s;
typedef long long ll;
//-----------------------------------------------------------------
int mypow(int x) {
	int ret = 1;
	rep(i, 1, x + 1) ret *= i;
	return ret;
}
//-----------------------------------------------------------------
bool done[150000000];
int main() {
	cin >> s;

	int sum = 0;
	rep(i, 0, s.length()) if (s[i] != '.') sum = sum * 10 + (s[i] - '0');
	sum = sum * 4 / 100;

	ll ans = 0;
	rep(i, 0, 101) rep(j, i, 101) rep(ii, j, 101) {
		int jj = sum - (i + j + ii);

		if (0 <= jj && jj <= 100) {
			vector<int> v;
			v.push_back(i);
			v.push_back(j);
			v.push_back(ii);
			v.push_back(jj);
			sort(v.begin(), v.end());

			int hash = 0;
			rep(k, 0, 3) hash = hash * 103 + v[k];
			if (done[hash]) continue;
			done[hash] = true;

			int cnt[4];
			rep(k, 0, 4) cnt[k] = 1;
			int idx = 0;
			rep(k, 1, 4) {
				if (v[k - 1] == v[k])
					cnt[idx]++;
				else {
					idx++;
				}
			}

			ll da;
			
			da = v[0] * (100 - v[idx]) * mypow(6);
			rep(k, 0, 4) da /= mypow(cnt[k]);
			ans += da;

			da = (100 - v[idx]) * mypow(6);
			cnt[0]++;
			rep(k, 0, 4) da /= mypow(cnt[k]);
			cnt[0]--;
			ans += da;
			

			da = v[0] * mypow(6);
			cnt[idx]++;
			rep(k, 0, 4) da /= mypow(cnt[k]);
			cnt[idx]--;
			ans += da;
			

			da = mypow(6);
			cnt[0]++;
			cnt[idx]++;
			rep(k, 0, 4) da /= mypow(cnt[k]);
			ans += da;
		}
	}
	cout << ans << endl;
	
}