#include using namespace std; long long dp[6][101][101][601]; int main() { double x; cin >> x; int sum = (int)(x * 4 + 1e-9); long long ans = 0; int lim = sum + 200; for (int i = 0; i < 101; ++i) { dp[0][i][i][i] = 1; } for (int i = 1; i < 6; i++) { for (int j = 0; j < 101; j++) { for (int k = j; k < 101; k++) { for (int l = 0; l <= lim; ++l) { if (dp[i - 1][j][k][l] == 0) continue; for (int m = 0; m < 101 && l + m <= lim; ++m) { dp[i][min(j, m)][max(k, m)][l + m] += dp[i - 1][j][k][l]; } } } } } for (int i = 0; i < 101; ++i) { for (int j = i; j < 101; ++j) { ans += dp[5][i][j][sum + i + j]; } } cout << ans << "\n"; return 0; }