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;

class Main {

    static int calc(int sum){
	return Math.min(sum, 18 - sum) + 1;
    }

    public static void main(String[] args){
	Scanner stdin = new Scanner(System.in);
	while(stdin.hasNextInt()){
	    int sum = stdin.nextInt();
	    int ab = 0;
	    int cd = 0;
	    int ans = 0;
	    for(ab = 0; ab <= 18 && ab + cd <= sum; ab++){
		for(cd = 0; cd <= 18 && ab + cd <= sum; cd++){
		    if(ab + cd == sum){
			ans += calc(ab) * calc(cd);
		    }
		}
		cd = 0;
	    }
	    System.out.println(ans);
	}
    }
}