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.*;

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}
	
	private void run() {
		Scanner scan = new Scanner(System.in);
		while (scan.hasNext()) {
			int n = scan.nextInt();
			int sum = 0;
			for (int i = 9; i >= 0; i--) {
				for (int j = 9; j >= 0; j--) {
					for (int k = 9; k >= 0; k--) {
						for (int l = 9; l >= 0; l--) {
							if (i + j + k + l == n) {
								sum++;
							}else if (i + j + k + l < n) {
								break;
							}
						}
					}
				}
			}
			System.out.println(sum);
		}
	}
}