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.

Example

Input

35
1


Output

4
4
import java.util.Scanner;


public class Main {
	public static void main(String tok[])
	{
		int n,a,b,c,d,co;
		Scanner ui = new Scanner (System.in);
	    while(ui.hasNext()){
      n=ui.nextInt();
      co=0;
	        for(a=0;a<=9;a++){
	            for(b=0;b<=9;b++){
	                for(c=0;c<=9;c++){
	                    for(d=0;d<=9;d++){
	                        if(a+b+c+d==n)co++;
	                    }
	                }
	            }
	        }
	   System.out.println(co);
	    }
	    ui.close();
	    
	}
}