Problem:
Sum of 4 Integers

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.

Sample Input

35
1

Output for the Sample Input

4
4

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	public static final int MAX = 999999;
	static int[] p = new int[MAX + 1];

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		Arrays.fill(p, 0);
		while (scanner.hasNext()) {
			int n = scanner.nextInt();
			int cnt = 0;
			for(int i = 2; i <= n; i++) {
				if(isPrime(i)) {
					cnt++;
				}
			}
			System.out.println(cnt);
		}
	}

	private static boolean isPrime(int i) {
		if(p[i] == 0) {
			double root = Math.sqrt(i);
			for(int j = 2; j <= root; j++) {
				if(i % j == 0) {
					p[i] = 2;
					return false;
				}
			}
			p[i] = 1;
			return true;
		}
		if (p[i] == 1) {
			return true;
		}
		return false;
	}


}