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.InputStreamReader;
class Main{
    public static void main(String args[]){
	try{
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    String str;
	    int count = 0;
	    int[] val = new int[4];
	    while(null != (str = br.readLine())){
		int n = Integer.parseInt(str);
		count =0;
	    if(n >= 37) //満たすものなし
		System.out.println("0");
	    else{
		for (val[0] = 0; val[0] < 10; val[0]++) {
		    for (val[1] = 0; val[1] < 10; val[1]++) {
			for (val[2] = 0; val[2] < 10; val[2]++) {
			    for (val[3] = 0; val[3] < 10; val[3]++) {
				if((val[0]+val[1]+val[2]+val[3]) == n){
				    count++;
				}
			    }
			}
		    }
		}
	    }
	    System.out.println(count);
	    }
	}
	catch(Exception e){
	    System.exit(0);
	}
    }
}