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;
using System.Text;

namespace ConsoleApplication5
{
    class Program
    {
        static void Main(string[] args)
        {
             string line;
             while ((line = Console.ReadLine()) != null)
             {
                 var ab = line.Split().Select(int.Parse).ToArray();
                 int a = ab[0];
                 int b = 0,c=10;
                for (int g = 0; g < c; g++)
                {
                    for (int h = 0; h < c; h++)
                    {
                        for (int i = 0; i < c; i++)
                        {
                            for (int j = 0; j < c; j++)
                            {
                                if (g + h + i + j == a)
                                    b += 1;
                                
                            }
                        }
                    }
                }
                Console.WriteLine(b);
           }
        }
    }
}