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)

while sum=gets.to_i
  if sum==nil then
    break
  end

  pattern = 0
  for num1 in 0..9
    for num2 in 0..9
      for num3 in 0..9
        for num4 in 0..9
          if num1+num2+num3+num4 == sum then
            pattern += 1
          end
        end
      end
    end
  end
  puts pattern
end