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)

# Sum of 4 Integers

x = []
i = j = k = l = 10
i.times{|i|j.times{|j|k.times{|k|l.times{|l|x << i+j+k+l}}}}
xx = x.group_by{|e|e}

while n = ARGF.gets.to_i do
	if n > 36
		puts 0
		next
	end
	puts xx[n].size
end