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 Rust (judge verdict: Wrong Answer)

use std::io::{stdin, BufRead, BufReader};
fn main() {
    let input = BufReader::new(stdin());
    for line in input.lines() {
        let n: i32 = line.unwrap().trim().parse::<i32>().unwrap();
        println!("{}", combination(n, 4));
    }
}

fn combination(n: i32, i: i32) -> u32 {
    if n > i * 9 || n < 0 {
        return 0;
    } else if i == 1 && n <= 9 {
        println!(" {} ", n);
        return 1;
    } else {
        let mut c = 0;
        for j in 0..10 {
            c += combination(n - j, i - 1);
        }
        return c;
    }
}