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) {
        try (Scanner sc = new Scanner(System.in)) {
        	while(sc.hasNext()) {
        		int[] dp=new int[51];
        		int n = sc.nextInt();
        		for(int i=0; i<=9; i++) {
        			for(int j=0; j<=9; j++) {
        				for(int k=0; k<=9; k++) {
        					for(int s=0; s<=9; s++) {
        						dp[i+j+k+s]++;
        					}
        				}
        			}
        		}
        		System.out.println(dp[n]);
        	}
        }
    }
}
