Write a program which reads an integer n and identifies the number of combinations of a, b, c and d (0 ≤ a, b, c, d ≤ 9) which meet the following equality:

a + b + c + d = n

For example, for n = 35, we have 4 different combinations of (a, b, c, d): (8, 9, 9, 9), (9, 8, 9, 9), (9, 9, 8, 9), and (9, 9, 9, 8).



Input

The input consists of several datasets. Each dataset consists of n (1 ≤ n ≤ 50) in a line. The number of datasets is less than or equal to 50.

Output

Print the number of combination in a line.

Example

Input

35
1


Output

4
4
memo = [[None for i in range(51)] for j in range(5)]
memo[0][0] = 1
for i in range(1, 51):
    memo[0][i] = 0


def f(n, sm):
    if memo[n][sm] is not None:
        return memo[n][sm]
    memo[n][sm] = 0
    for i in range(min(10, sm + 1)):
        memo[n][sm] += f(n - 1, sm - i)
    return memo[n][sm]

try:
    while True:
        print f(4, int(raw_input()))
except:
    pass