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)


def calcNumbers(n)
  num = Array.new()
  tmp = n
  while (num.size() != 4)
    if tmp >= 9
      tmp = tmp - 9
      num.push(9)
    else
      if (tmp == 0)
        num.push(0)
      else
        num.push(tmp)
        tmp = 0
      end
    end
  end
  return num
end

def fact(n)
  if n == 0
    1
  else
    n * fact(n-1)
  end
end

def calcCombine(n)
  return 24 / (fact(r(n)))
end

def pre_r(n, d)
  a = 0
  i = 0
  while i < n.size
    if n[i] == d
      a += 1
    end
    i += 1
  end
  return a
end

def r(n)
  a = pre_r(n, 0)
  b = pre_r(n, 9)
  return a > b ? a : b
end

input = Array.new()

while (line = gets) != nil
  input.push(line.to_i)
end

for i in input
  if (i > 36)
    puts 0
  else
    puts calcCombine(calcNumbers(i))
  end
end