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 n = sc.nextInt();
				System.out.println(solve(n, 0));
			}
		}
	}

	public static int solve(int n, int d) {
		if (n < 0 || n > (4 - d) * 9 || d > 4) {
			return 0;
		}
		if (d == 4 && n == 0) {
			return 1;
		}
		int result = 0;
		for (int i = 0; i <= 9; i++) {
			result += solve(n - i, d + 1);
		}
		return result;
	}
}