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 int Main(string[] args) {
        List<int> list = new List<int>();

        while (true) {
            string v = Console.ReadLine();
            if (string.IsNullOrEmpty(v) == true) { break; }

            list.Add(int.Parse(v));
        }

        Dictionary<int, int> kumiList = new Dictionary<int, int>();
        for (int i = 0; i < 10000; i++) {
            string v = i.ToString();
            int t = 0;
            for (int c = 0; c < v.Length; c++) {
                t += int.Parse(v.Substring(c, 1));
            }
            if (kumiList.ContainsKey(t) == false) {
                kumiList.Add(t, 1);
            }
            else {
                kumiList[t]++;
            }
        }

        for (int i = 0; i < list.Count; i++) {
            if (kumiList.ContainsKey(list[i]) == false) {
                Console.WriteLine("0");
            }
            else {
                Console.WriteLine(kumiList[list[i]]);
            }
        }

        return 0;
    }
}