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){
		
		Scanner sc = new Scanner(System.in);
		int n;
		while(sc.hasNextInt()) {
			n = sc.nextInt();
			System.out.println(combinationOf4Integers(n));
		}
		sc.close();
	}

	static int sumOf4Integers(int a, int b, int c, int d) {
		return a + b + c + d;
	}
	
	static int combinationOf4Integers(int n) {
		int result = 0;
		for(int i = 0; i <= 9; i++) {
			for(int j = 0; j <= 9; j++) {
				for(int k = 0; k <= 9; k++) {
					for(int l = 0; l <= 9; l++) {
						if(sumOf4Integers(i, j, k, l) == n) result++;
					}
				}
			}
		}
		return result;
	}
}