import java.util.Scanner;

public class Problem288 {
    public static void main(String[] args) {
        int N = new Scanner(System.in).nextInt();
        System.out.println(dp(N));
    }

    public static long dp(int n) {
        long[][] dp = new long[9][];
        for (int i = 0; i < dp.length; i ++) {
            dp[i] = new long[6 * n + 1];
        }
        dp[0][0] = 1;

        for (int i = 1; i <= 8; i ++){
            for (int j = 0; j <= 6 * n; j ++) {
                for (int k = 0; k <= n; k ++) {
                    if (j >= k)
                        dp[i][j] += dp[i - 1][j - k];
                }
            }
        }
        return dp[8][6 * n];
    }
}