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: Accepted)

import java.util.*;

class Main {
  public static void main (String[] args) {
    Scanner scanner = new Scanner(System.in);
    String out = "";
    while (scanner.hasNext()) {
      int a = scanner.nextInt();
      int c = 0;
      if (a == 0 || a > 36) {
        out += "0\n";
        continue;
      }
      if (a == 36) {
        out += "1\n";
        continue;
      }
      for (int ii = 0; ii < 10; ii++) {
        for (int jj = 0; jj < 10; jj++) {
          for (int mm = 0; mm < 10; mm++) {
            for (int nn = 0; nn < 10; nn++) {
              if (ii + jj + mm + nn == a) {
                c++;
              }
            }
          }
        }
      }
      out += c + "\n";
    }
    System.out.print(out);
  }
}