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;

class Program
{
    static string InputPattern = "Input2";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("35");
            WillReturn.Add("1");
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();

        Func<int, int> DeriveCombiCntFunc = (pSum) =>
        {
            int WillReturn = 0;
            for (int A = 0; A <= 9; A++) {
                for (int B = 0; B <= 9; B++) {
                    for (int C = 0; C <= 9; C++) {
                        for (int D = 0; D <= 9; D++) {
                            if (A + B + C + D == pSum)
                                WillReturn++;
                        }
                    }
                }
            }
            return WillReturn;
        };

        InputList.ForEach(X => Console.WriteLine(DeriveCombiCntFunc(int.Parse(X))));
    }
}