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)

// tested on node version 0.10.36
var fs = require("fs");

function count_combinations(n) {
    var count = 0;
    for(var a = 0; a < 10; a++) {
        for(var b = 0; b < 10; b++) {
            for(var c = 0; c < 10; c++) {
                for(var d = 0; d < 10; d++) {
                    if(a + b + c + d === n) {
                        count++;
                    }
                }
            }
        }
    }
    return count;
}

var input = fs.readFileSync('/dev/stdin').toString();
var lines = input.split("\n");
for(var i = 0; i < lines.length; i++) {
    var n = parseInt(lines[i]);
    if(!isNaN(n)) {
        console.log(count_combinations(n));
    }
}