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 MIN = 0,
    MAX = 9;
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on("data",function(chunk){
    var n = String(chunk).trim().split("\n").map(function(v){return parseInt(v, 10)});
        for (var m = 0; m < n.length; m++) {
            var count = 0;
        for (var i = MIN; i <= MAX; i++) {
            for (var j = MIN; j <= MAX; j++) {
            for (var k = MIN; k <= MAX; k++) {
            for (var l = MIN; l <= MAX; l++) {
            if(i + j + k + l == n[m]) {
                count++;
            }
        }
        }
        }
        }
        console.log(count);
        }
});