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 java.util.Scanner

import scala.collection.mutable.ListBuffer

object Main {
  def main(args : Array[String]) = {
    val scanner = new Scanner(System.in)
    val inputs = ListBuffer.empty[Int]
    while(scanner.hasNextLine) {
      inputs += scanner.nextLine().toInt
    }

    def count(curNum:Int, curCnt:Int, targetN:Int):Int = {
      if(curCnt == 4) {
        if(curNum == targetN) {
          return 1
        }else{
          return 0
        }
      }

      var totalCount = 0
      (0 to 9).foreach{num =>
        totalCount += count(curNum + num, curCnt + 1, targetN)
      }

      totalCount
    }

    inputs.foreach { n =>
      val result = count(0, 0, n)
      println(result)
    }
  }
}