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
while True:
	ans = 0
	try:
		n = input()
		
	except (EOFError):
		break
	
	for a in range(10):
		atmp = n - a
		if(-1 < atmp and atmp<28):
			for b in range(10):
				btmp = atmp - b
				if(-1 < btmp and btmp<19):
					for c in range(10):
						d = btmp  - c
						if(-1 < d and d<10):
							ans += 1
							#print (a, b, c, d)
	print ans
						