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`).

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.

Print the number of combination in a line.

35 1

4 4

Source: PC Koshien 2003
, All-Japan High School Programming Contest, Aizu-Wakamatsu, Japan, 2003

http://www.pref.fukushima.jp/pc-concours/

http://www.pref.fukushima.jp/pc-concours/