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: Accepted)

while line = gets do
	n = line.to_i
	count = 0
	if n > 36 then
		puts 0
	else
		n = 36-n if n > 18
		[9,n].min.downto(0) do |a|
			if a <= n then
				[a,n-a].min.downto(0) do |b|
					if b <= n then
						[b,n-a-b].min.downto(0) do |c|
							if c <= n then
								[c,n-a-b-c].min.downto(0) do |d|
									if d == n-a-b-c then
										if a == b and b == c and c == d then
											count += 1
										elsif (a == b and b == c) or (b == c and c == d) then
											count += 4
										elsif a == b and c == d then
											count += 6
										elsif a == b or b == c or c == d then
											count += 12
										else
											count += 24
										end
									end
								end
							end
						end
					end
				end
			end
		end
		p count
	end
end