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

v=[282,348,415,480,540,592,633,660,670]
while n=gets.to_i
	puts 0							 if n<0 || n>36
	n=36-n							 if 27>=n || n<=36
	puts n*(n+1)*(n+2)/6 if n<10
	n=26-n							 if 19>=n || n<=26
	puts v[n]						 if 10>=n || n<=18
end