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;

namespace _008_Sumof4Integers
{
	class Program
	{
		static void Main ( string[] args )
		{
			string inputStr;

			while ((inputStr = Console.ReadLine ()) != null)
			{
				int count = 0;
				int limit = int.Parse (inputStr);

				for (int loop = 0; loop < 10; loop++)
				{
					for (int loop2 = 0; loop2 < 10; loop2++)
					{
						for (int loop3 = 0; loop3 < 10; loop3++)
						{
							for (int loop4 = 0; loop4 < 10; loop4++)
							{
								if (loop + loop2 + loop3 + loop4 == limit)
									count++;
							}
						}
					}
				}

				Console.WriteLine (count);
			}
		}
	}
}