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)

object Main extends App {
  for (i <- 0 until 50) {
    val strn = readLine()
    if (strn.nonEmpty) {
      val n = strn.toInt
      val sumperms = for {
        a <- 0 to 9
        b <- 0 to 9
        c <- 0 to 9
        d <- 0 to 9
      } yield { a + b + c + d }
      println(sumperms.count(_==n))
    }
  }
}