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.*;

public class Main {
    public static void main (String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n =scanner.nextInt();
        int combination = 0;
        
        for (int i = 0; i < 10; i++) {
            int sum1 = 0;
            sum1 += i;
            if (sum1 > n) {
                break;
            }
            for (int j = 0; j < 10; j++) {
                int sum2 = sum1;
                sum2 += j;
                if (sum2 > n) {
                    break;
                }
                for(int k = 0; k < 10; k++) {
                    int sum3 = sum2;
                    sum3 += k;
                    if (sum3 > n) {
                        break;
                    }
                    for(int l = 0; l < 10; l++) {
                        int sum4 = sum3;
                        sum4 += l;
                        if (sum4 == n) {
                            combination++;
                        }
                    }
                }
            }
        }
        System.out.println(combination);
    }
}