import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		solver();
	}

	static void solver() {
		Scanner sc = new Scanner(System.in);
		double X = sc.nextDouble();
		int n = (int) (X * 4);
		long[][][] from = new long[101][101][601];
		long[][][] to = new long[101][101][601];
		from[100][0][0] = 1;
		for (int i = 0; i < 6; i++) {
			for (int x = 0; x <= 100; x++) {
				for (int y = 0; y <= 100; y++) {
					for (int j = 0; j <= 100 * i; j++) {
						if (from[x][y][j] != 0) {
							for (int k = 0; k <= 100; k++) {
								to[Math.min(x, k)][Math.max(y, k)][j + k] += from[x][y][j];
							}
						}
					}
				}
			}
			long[][][] d = to;
			to = from;
			from = d;
			to=init(to);
		}
		long sum=0;
		for(int i=0;i<=100;i++){
			for(int j=0;j<=100;j++){
				for(int k=0;k<=600;k++){
					if(k-(i+j)==n){
						sum+=from[i][j][k];
					}
				}
			}
		}
		System.out.println(sum);
	}

	static long[][][] init(long[][][] a) {
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[0].length; j++) {
				for (int k = 0; k < a[0][0].length; k++) {
					a[i][j][k] = 0;
				}
			}
		}
		return a;
	}
}