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;

namespace _0008
{
    class Program
    {
        static void Main(string[] args)
        {
            const int MAX_NUMBER = 9;
            while (true)
            {
                var input = Console.ReadLine();

                if (string.IsNullOrEmpty(input)) { break; }

                var number = int.Parse(input);
                var answer = 0;

                for (int first = 0; first<= MAX_NUMBER; first++)
                {
                    for (int second = 0; second <= MAX_NUMBER; second++)
                    {
                        for (int third = 0; third <= MAX_NUMBER; third++)
                        {
                            for (int fouth = 0; fouth <= MAX_NUMBER; fouth++)
                            {
                                int sum = first+second+third+fouth;
                                if (sum == number)
                                {
                                    answer++;
                                }
                            }
                        }
                    }
                }
                Console.Write(answer.ToString()+"\n");
            }
        }
    }
}