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)

var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var comb = input.split('\n');
 
var set;
while (set = comb.shift()) {
    var count = 0;
    var num = +set;
    for (var i1 = 0; i1 <= 9; i1++){
    	for (var i2 = 0; i2 <= 9; i2++){
    		for (var i3 = 0; i3 <= 9; i3++){
    			for (var i4 = 0; i4 <= 9; i4++){
        			if (i1 + i2 + i3 + i4 == num)
            			count++;
    				}
				}
			}
		}
    console.log(count);
}