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)

# -*- coding: utf-8 -*-

n = gets.chomp.to_i
ans = 0

i = 0
while i < 9
  j = 0
  while j < 9
    k = 0
    while k < 9
      l = 0
      while l < 9
        p "#{i}+#{j}+#{k}+#{l}" if i+j+k+l == 1
        ans+=1 if i+j+k+l == n
        l+=1
      end
      k+=1
    end
    j+=1
  end
  i+=1
end

puts ans