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: Wrong Answer)

a = STDIN.gets.chomp.to_i
res = []

loop do
  break if a <= 0

  b = a % 10
  a -= b.zero? ? 10 : b
  res << b
end

(4 - res.size).times.each { res << 0 }

case res.uniq.size
when 1
  puts 1
when 2
  puts 4
when 3
  puts 12
else
  puts 24
end