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 ConsoleApplication3
{
    class Program
    {
        public static void Main()
        {
            while (true)
            { int sss = 0;
                string a = Console.ReadLine();
                if (a == null) break;
                int b = int.Parse(a);
                for(int c = 0; c < 10; c++)
                {
                    for(int d = 0; d < 10; d++)
                    {
                        for(int e = 0; e < 10; e++)
                        {
                            if (b - e - d - c > -1 && b - e - d - c < 10) sss++;
                        }
                    }
                }
                Console.WriteLine(sss);
            }
        }
    }
}