import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    memo={}
    def f(s,r):
        if s==0 or r==1:return 1
        if (s,r) in memo:return memo[s,r]
        res=0
        for i in range(min(n,s),-1,-1):
            if s-i>(r-1)*n:break
            res+=f(s-i,r-1)
        memo[s,r]=res
        return res

    n=II()
    print(f(n*6,8))

main()