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.ArrayList;
import java.util.List;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		List<Integer> ret = new ArrayList<Integer>();
		while (sc.hasNext()) {
			int i, j, k, l;
			int cnt = 0;
			int input = sc.nextInt();
			for (i = 0; i <= 9; i++) {
				for (j = 0; j <= 9; j++) {
					for (k = 0; k <= 9; k++) {
						for (l = 0; l <= 9; l++) {
							if (i + j + k + l == input) {
								cnt++;
							}
						}
					}
				}
			}
			ret.add(cnt);
		}
		for (int cnt : ret) {
			System.out.println(cnt);
		}
	}
}