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

n1 = []
(0..9).each { |x| n1[x] = 1 }
(10..50).each { |x| n1[x] = 0 }

n2 = []
(0..50).each { |x|
    n2[x] = 0
    (0..9).each {|y|
        n2[x] += n1[x - y] || 0
    }
}

n3 = []
(0..50).each {|x|
    n3[x] = 0
    (0..9).each {|y|
        n3[x] += n2[x - y] || 0
    }
}

n4 = []
(0..50).each {|x|
    n4[x] = 0
    (0..9).each {|y|
        n4[x] += n3[x - y] || 0
    }
}

while n = gets
    puts n4[n.to_i]
end