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[] args) {
		int input;
		int a,b,c,d;
		int count=0;
		int tmp_a, tmp_b, tmp_c;
		Scanner scanner = new Scanner(System.in);
		while(scanner.hasNext()){
			input = scanner.nextInt();
			
			for(a=9; a>=0; a--){
				if( (tmp_a = (input - a)) >= 0){
					for(b=9; b>=0; b--){
						if((tmp_b = (tmp_a - b)) >= 0){
							for(c=9; c>=0; c--){
								if((tmp_c = (tmp_b - c)) >= 0){
									if(tmp_c <= 9){
										count++;
									}
								}
							}
						}
					}
				}
			}
			System.out.println(count);
			count = 0;
		}
	}
}