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
# coding=utf-8


def making_n(usable_numbers: int, target: int) -> int:
    if usable_numbers == 1:
        if 0 <= target <= 9:
            return 1
        return 0
    count = []
    for i in range(10):
        count.append(making_n(usable_numbers - 1, target - i))
    return sum(count)


if __name__ == '__main__':
    while True:
        try:
            n = int(input())
        except EOFError:
            break
        print(making_n(4, n))