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: Wrong Answer)

N = 1000000
arr = [1] * N
arr[0] = 0
arr[1] = 0

2.upto(N / 2){|i|
	if arr[i] == 1
		(i**2).step(N, i){|j|
			arr[j] = 0
		}
	end
}

2.upto(N){|i|
	arr[i] += arr[i-1]
}

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