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 Scala (judge verdict: Accepted)

import scala.io.Source.stdin

object Main {
  def sumEqInt(n: Int): Int = {
    (for (i <- 0 to 9;
      j <- 0 to 9;
      k <- 0 to 9;
      l <- 0 to 9 if i+j+k+l == n) yield s"$i$j$k$l").length
  }

  def main(args: Array[String]): Unit = {    
    val num = stdin.getLines
    num.foreach(i => println(sumEqInt(i.toInt)))
  }
}