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

namespace _0008
{
    class Program
    {
        static void Main(string[] args)
        {
            Calc calc = new Calc();
            // nが入力された時の、a+b+c+d=nを満たす組み合わせの数を出力するプログラム
            // a,b,c,dの範囲はいずれも0～9の範囲の整数とする。

            string str ="";
            while ((str = Console.ReadLine()) != null)
            {
                int count = 0;
                int n = int.Parse(str);

                count = calc.combination(count, n);

                Console.WriteLine(count);
            }
        }
    }

    public class Calc
    {
        public int combination(int count, int n)
        {
            for (int a = 0; a < 10; a++)
            {
                for (int b = 0; b < 10; b++)
                {
                    for (int c = 0; c < 10; c++)
                    {
                        for (int d = 0; d < 10; d++)
                        {
                            count = Count(a, b, c, d, n, count);
                        }
                    }
                }
            }
            return count;
        }

        public int Count(int a, int b, int c, int d, int n, int count)
        {
            if (a + b + c + d == n)
            {
                count++;
            }
            return count;
        }
    }
}