n = input()
dp = [[-1]*(6*n+1) for i in xrange(8)]
def dfs(c, rest):
    if c<0: return rest==0
    v = dp[c][rest]
    if v != -1: return v
    r = dp[c][rest] = sum(dfs(c-1, rest-i) for i in xrange(min(n, rest)+1))
    return r
print dfs(7, 6*n)