Problem:
Sum of 4 Integers

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.

Sample Input

35
1

Output for the Sample Input

4
4

Solution in Python3 (judge verdict: Accepted)

import sys
import itertools

def countcombi(n):
    r = 0
    p = list(itertools.product(range(0,10),repeat = 4))
    for tmp in p:
        if sum(tmp) == n:
            r += 1
    return r


if __name__ == '__main__':
    for line in sys.stdin:
        n = (int)(line)
        print(countcombi(n))