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
public class Main {
	static java.util.Scanner scan = new java.util.Scanner(System.in);
	public static void main(String[] args) {
		int input = 0;
		while (scan.hasNextInt()) {
			input = scan.nextInt();
			int total = 0;
			for (int h = 0; h < 10; ++h)
				for (int i = 0; i < 10; ++i)
					for (int j = 0; j < 10; ++j)
						for (int k = 0; k < 10; ++k)
							if (h + i + j + k == input)
								++total;
			print(total);
			
		}
	}
	
	public static void print(Object out) {
		System.out.println(out);
	}
}