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
num = []
while True:
    try:
        num.append(int(input()))
    except EOFError:
        break

for i in num:
    s = set()
    for a in range(10):
        if i-a > 27:
            continue
        for b in range(10):
            if i-a-b > 18:
                continue
            for c in range(10):
                if i-a-b-c > 9:
                    continue
                elif i-a-b-c < 0:
                    break
                else:
                    s.add(str(a)+str(b)+str(c)+str(i-a-b-c))
    print(len(s))