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

import Control.Applicative

func _ 10 _ _ _ _ = 0
func _ _ 10 _ _ _ = 0
func _ _ _ 10 _ _ = 0
func _ _ _ _ 10 _ = 0
func n a b c d cur = if a+b+c+d == n
                    then 1
                    else if a+b+c+d>n 
                        then 0
                        else case cur of
                            0 -> (func n (a+1) b c d cur) + (func n a b c d (cur+1))
                            1 -> (func n a (b+1) c d cur) + (func n a b c d (cur+1))
                            2 -> (func n a b (c+1) d cur) + (func n a b c d (cur+1))
                            3 -> (func n a b c (d+1) cur) + (func n a b c d (cur+1))
                            _ -> 0
                            
func' n = func n 0 0 0 0 0

main=do{
    n <- map (read::String->Int) . lines <$> getContents;
    mapM_ print $ map func' n
}