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.IO;
using System.Collections;
using System.Linq;
using System.Collections.Generic;

public class Sample9{

	public static void Main(){

		List <int> numList = new List<int> ();

		while (true) {
			string line = Console.ReadLine ();

			if (line != null) {
				numList.Add (int.Parse(line));
			} else {
				break;
			}
		}
			
		foreach (int n in numList) {
			int result = getResult (n);
			Console.WriteLine (result);
		}

	}

	public static int getResult(int num){

		int count = 0;

		for (int i = 0; i <= 9; i++) {

			for (int j = 0; j <= 9; j++) {

				for (int k = 0; k <= 9; k++) {

					for (int l = 0; l <= 9; l++) {
						if (i + j + k + l == num) {
							count++;
						} else if (i + j + k + l > num) {
							break;
						} else {
							continue;
						}
					}
				}
			}
		}

		return count;
	}
}