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 comb(n, x)
  if x != 2
    result = 0
    for i in ((n - (x - 1) * 9) < 0 ? 0: (n - (x - 1) * 9))..(n > 9 ? 9: n)
      result += comb(n - i, x - 1)
    end
    return result
  else
    return (n < 9 ? (n + 1): (19 - n))
  end
end
while (n = gets)
  puts comb(n.to_i, 4)
end