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 C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

namespace AOJ
{
  class Program
  {
    public static void Main(string[] args)
    {
      foreach (var n in ReadNumbers())
      {
        int count = 0;
        foreach (var a in Enumerable.Range(0, 10))
          foreach (var b in Enumerable.Range(0, 10))
            foreach (var c in Enumerable.Range(0, 10))
              foreach (var d in Enumerable.Range(0, 10))
                if (a + b + c + d == n)
                  ++count;
        Console.WriteLine(count);
      }
    }

    static IEnumerable<int> ReadNumbers()
    {
      string line;
      while ((line = Console.ReadLine()) != null)
        yield return int.Parse(line);
    }
  }
}