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
  num = line.chomp

  cnt = 0

  10000.times do |i|

    str = sprintf("%04d",i)
    sum = str[0].to_i + str[1].to_i + str[2].to_i + str[3].to_i

    #puts str[0] +"-" + str[1]+"-" +str[2]+"-" +str[3]
    #puts str
    #puts sum

    if(sum.to_i == num.to_i)
      cnt = cnt +1
    end
  end

  puts cnt
end