



from math import factorial






def  UpperCAmelCase__    (    lowercase__ = 20   ) ->      int:
						__lowercase					=				2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
						# 2, 3,...
						__lowercase					=				n // 2

						return int(factorial(lowercase__   ) / (factorial(lowercase__   ) * factorial(n - k   ))   )


if __name__ == "__main__":
			import sys

			if len(sys.argv) == 1:
						print(solution(20))
			else:
						try:
									UpperCamelCase__ =						int(sys.argv[1])
									print(solution(n))
						except ValueError:
									print("Invalid entry - please enter a number.")










def  UpperCAmelCase__    (    lowercase__   ) ->      Optional[int]:
						__lowercase					=				len(lowercase__   )
						__lowercase					=				sum(lowercase__   )

						__lowercase					=				[[False for x in range(s + 1   )] for y in range(n + 1   )]

						for i in range(1						,       n + 1   ):
												__lowercase					=				True

						for i in range(1						,       s + 1   ):
												__lowercase					=				False

						for i in range(1						,       n + 1   ):
												for j in range(1						,       s + 1   ):
																		__lowercase					=				dp[i][j - 1]

																		if arr[i - 1] <= j:
																								__lowercase					=				dp[i][j] or dp[i - 1][j - arr[i - 1]]

						for j in range(int(s / 2   )						,       -1						,       -1   ):
												if dp[n][j] is True:
																		__lowercase					=				s - 2 * j
																		break

						return diff





