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.

Example

Input

35
1


Output

4
4
def four_nums(n, ans, nums):
	if len(nums) == 4:
		if sum(nums) == n:
			return ans + 1
		else:
			return ans
	for i in range(10):
		nums.append(i)
		if sum(nums) <= n: ans = four_nums(n, ans, nums)
		nums.pop()
	return ans

while True:
	try:
		n = input()
		print four_nums(n, 0, [])
	except:
		break