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
import sys
#from me.io import dup_file_stdin

#@dup_file_stdin
def solve():
    for s in map(int,sys.stdin):
        results=set()
        for a in range(10):
            for b in range(10):
                for c in range(10):
                    d = s-a-b-c
                    if d<0:break
                    if d<=9: results.add((a,b,c,d))
        print(len(results))
solve()