package no398;

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int x = (int) Math.round(sc.nextDouble() * 4);

		int n = 6;
		long[][][][] dp = new long[n][101][101][601];
		for(int i=0;i<=100;i++) {
			dp[0][i][i][i] = 1;
		}
		for(int i=0;i<n-1;i++) {
			for(int min=0;min<=100;min++) {
				for(int max=min;max<=100;max++) {
					for(int sum=0;sum<=600;sum++) {
						if (dp[i][min][max][sum] == 0) {
							continue;
						}
						for(int k=0;k<=100;k++) {
							int nmin = Math.min(min, k);
							int nmax = Math.max(max, k);
							int nsum = sum + k;
							dp[i+1][nmin][nmax][nsum] += dp[i][min][max][sum];
						}
					}
				}
			}
		}
		
		long ans = 0;
		for(int min=0;min<=100;min++) {
			for(int max=min;max<=100;max++) {
				for(int sum=0;sum<=600;sum++) {
					if (sum - min - max == x) {
						ans += dp[n-1][min][max][sum];
					}
				}
			}
		}
		System.out.println(ans);
	}

}