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.Linq;

namespace AOJ0008
{
    class Program
    {
        static void Main()
        {
            string line;
            while ((line = Console.ReadLine()) != null)
            {
                var n = int.Parse(line);

                var count = (from a in Enumerable.Range(0, 10)
                             from b in Enumerable.Range(0, 10)
                             from c in Enumerable.Range(0, 10)
                             from d in Enumerable.Range(0, 10)
                             where a + b + c + d == n
                             select 0)
                    .Count();

                Console.WriteLine(count);
            }
        }
    }
}