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 PHP (judge verdict: Time Limit Exceeded)

<?php
echo "1";
$time = trim(fgets(STDIN));
for ($i = 0; $i < $time; $time++){
    $total = 0;
    $num = trim(fgets(STDIN));
    for ($x = 0; $x < 10; $x++){
        for ($y = 0; $y < 10; $y++){
            for ($z = 0; $z < 10; $z++){
                for ($w = 0; $w < 10; $w++){
                    echo "a";
                    if($x+$y+$z+$w == $num){
                        $total+=1;
                    }
                    
                }
            }
        }
        
    }
    echo $total;
    
}

?>