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;
class Program{
	static void Main(){
		string s;
		while((s = Console.ReadLine()) != null){
			int n = int.Parse(s);
			if(n>36) Console.WriteLine(0);
			else{
				if(n>18) n = 36-n;
				int ans = (n+1)*(n+2)*(n+3)/6;
				if(n>9) ans -= 2*(n-9)*(n-8)*(n-7)/3;
				Console.WriteLine(ans);
			}
		}
	}
}