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: Accepted)

import java.util.Scanner;
class Main{
    public static void main(String[] a){
    	
    	Scanner scan = new Scanner(System.in);
    	while (scan.hasNext()){ 
    	int n = 0;
    	int count = 0;
    	n = scan.nextInt();
    	
    	for(int i = 0; i < 10;i++){
    		for(int k = 0; k < 10; k++){
    			for(int y = 0; y < 10; y++){
    				for(int j = 0; j < 10; j++){
    					
    					if(i+k+y+j == n){
    						count += 1;
    					}
    				}
    			}
    		}
    	}
    	System.out.println(count);
    	}
 }
}