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: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str = br.readLine();
		Boolean isEnd = str == null;
		int count;
		while (!isEnd) {
			int n = Integer.parseInt(str);
			count = 0;
			for (int a = 0; a <= 9; a++) {
				if (n - a < 0) {
					break;
				}
				for (int b = 0; b <= 9; b++) {
					if (n - a - b < 0) {
						break;
					}
					for (int c = 0; c <= 9; c++) {
						if (n - a - b - c < 0) {
							break;
						} else if (n - a - b - c > 9) {
							continue;
						} else {
							count++;
						}
					}
				}
			}
			System.out.println(count);
			str = br.readLine();
			isEnd = str == null;
		}
	}

}