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 JAVA (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {
    public static int number;
    public static int res;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        number = sc.nextInt();
        res = 0;
        for (int i = 0; i < 10; i++) {
            calc(i, 0, 1);
        }
        System.out.println(res);
    }
    public static void calc(int index, int sum, int rep) {
        sum += index;
        if (rep == 4) {
            if (sum == number) {
                res++;
            }
            return;
        }
        
        for (int i = 0; i < 10; i++) {
            calc(i, sum, rep + 1);
        }
    }
}