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)

def search_pattern( n )
	sum = 0
	0.upto( 9 ){|a|
		0.upto( 9 ){|b|
			0.upto( 9 ){|c|
				0.upto( 9 ){|d|
					sum += 1 if a + b + c + d == n
				}
			}
		}
	}
	#print "sum #{sum}\n"
	return sum
end

answer = Array.new
while line = $stdin.gets
	n = line.to_i
	answer << search_pattern( n )
end
answer.each{ |a|
	puts a
}