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 JavaScript (judge verdict: Time Limit Exceeded)

require("fs").readFileSync("/dev/stdin","utf8").trim().split('\n').map(function(i){p=0,j=+i;for(a=10;a--|a<j;)for(b=10;b--|a+b<j;)for(c=10;c--|a+b+c<j;)for(d=10;d--;)a+b+c+d>j?0:p++;console.log(p)})