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)

$S = 0
while $S = gets.to_i

$num = 0
$a = 0
begin
  if ($S - $a) <= 27
    $b = 0
    begin
      if ($S - $a - $b) <= 18
        $c = 0
        begin
          if ($S - $a - $b - $c) <= 9
            $d = 0
            begin
              if ($S - $a - $b - $c - $d) == 0
                $num += 1
              end
              $d += 1
            end while $d <= 9
          end
          $c += 1
        end while $c <= 9
      end
      $b += 1
    end while $b <= 9
  end
  $a += 1
end while $a <= 9

puts $num
end