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;


class A
{
    static void Main(string[] args)
    {
        while (true)
        {
            string hsda = Console.ReadLine();
            if (hsda == null) { break; }
            int ans = 0;
            int a = int.Parse(hsda);
            /*int[] s = new int[a + 1];

            if (a > 18) { a = 36 - a; }
            //   if (a == 1) { ans = 4; }else if (a == 0) { ans = 1; }
            if (a >= 1) { s[1] = 4; }
            s[0] = 1;
            if (a >= 2)
            {
                for (int i = 2; i <= a; i++)
                { s[i] = s[i - 2] + (i + 1) * (i + 1); }
            }
            Console.WriteLine(s[a]);
            //Console.ReadLine();
            */
            for(int i = 0; i < 10; i++) { for (int k = 0; k < 10; k++) { for (int m = 0; m < 10; m++) { for (int i1 = 0; i1 < 10; i1++) { if (i + k + m + i1 == a) { ans++; } } } } }
            Console.WriteLine(ans);
        }
    }
}