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 JAVA (judge verdict: Wrong Answer)

import java.util.*;
import java.io.*;

class Main
{
	public static void main(String[] args)
	{
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();

		for(int i=0; i<10; ++i){
			for(int j=0; j<10; ++j){
				if(!map.containsKey(i+j))
					map.put(i+j, 1);
				else
					map.put(i+j, map.get(i+j)+1);
			}
		}

		int ans = 0;
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

		try{
			int n = Integer.parseInt(bf.readLine());
			for(Map.Entry<Integer, Integer> e : map.entrySet()){
				Integer v = map.get(n-e.getKey());
				ans += (v==null ? 0 : v) * e.getValue();
			}
		}
		catch(IOException ex){
			System.out.println(ex);
		}

		System.out.println(ans);
	}
}