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 JavaScript (judge verdict: Accepted)

//config = { input: 'tmp', newline: '\r\n' }; // win
config = { input: '/dev/stdin', newline: '\n' }; // linux

const MAX = 50;

map0 = [];
for (i = 0; i <= MAX; i++) map0.push(0);
map1 = [].concat(map0);
map2 = [].concat(map1);
map3 = [].concat(map2);

for (i = 0; i <= 9; i++) map0[i] = 1;

function expand_map(map, smaller) {
	for (var i = 0; i < MAX; i++) {
		for (var j = Math.max(0, i - 9); j <= i; j++) {
			map[i] += smaller[j];
		}
	}
}

expand_map(map1, map0);
expand_map(map2, map1);
expand_map(map3, map2);

require('fs').readFileSync(config.input, 'ascii')
	.trim()
	.split(config.newline)
	.forEach(function (line) { console.log(map3[parseInt(line)]); })
	;