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)

#encoding:utf-8
numbers = []

while gets
 number = $_.to_i
 if $_ == ''
  break
 end
 numbers.push number.to_i
end

def count_pattern integer
 count = 0
 a = 0
 while a < 10
  b = 0
  while b < 10
   c = 0
   while c < 10
    d = 0
    while d < 10
     if a + b + c + d == integer
      count += 1
     end
     d += 1
    end
    c += 1
   end
   b += 1
  end
  a += 1
 end
 puts count
end

i = 0
while i < numbers.length
 count_pattern numbers[i]
 i += 1
end