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

for i in sys.stdin:
    i=int(i)
    count =0
    for a in range(9,-1,-1):
        k=i-a
        if(k==0):
            count+=1            
        if(k>0):
            for b in range(9,-1,-1):
                l=k-b
                if(l==0):
                    count+=1
                if(l>0):
                    for c in range(9,-1,-1):
                        m=l-c
                        if(m==0):
                            count+=1                            
                        if(m>0):
                            for d in range(9,-1,-1):
                                if(m-d==0):
                                    count+=1
                            
    print count