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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Main{
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String uketori=br.readLine();
		int sum=Integer.parseInt(uketori);
		long kazu = 0;
		if(sum>26 && sum<=36){
			int aki=36-sum;
			kazu=(aki+3)*(aki+2)*(aki+1)/6;
		}
		else if(sum>-1 && sum<10){
			int aki=sum;
			kazu=(aki+3)*(aki+2)*(aki+1)/6;
		}
		else{
			kazu=0;
		}

		System.out.println(kazu);
	}
}