
def 				UpperCAmelCase_						(				__SCREAMING_SNAKE_CASE				):
	lowercase	    =       [[0 for _ in range(__SCREAMING_SNAKE_CASE				)] for _ in range(m + 1				)]
	for i in range(m + 1				):
		lowercase	    =       1

	for n in range(m + 1				):
		for k in range(1					,				__SCREAMING_SNAKE_CASE				):
			memo[n][k] += memo[n][k - 1]
			if n - k > 0:
				memo[n][k] += memo[n - k - 1][k]

	return memo[m][m - 1]


if __name__ == "__main__":
	import sys

	if len(sys.argv) == 1:
		try:
			UpperCAmelCase       =					int(input('''Enter a number: ''').strip())
			print(partition(n))
		except ValueError:
			print('''Please enter a number.''')
	else:
		try:
			UpperCAmelCase       =					int(sys.argv[1])
			print(partition(n))
		except ValueError:
			print('''Please pass a number.''')








def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__							,lowerCAmelCase__						):
		if number < 0 or shift_amount < 0:
				raise ValueError('both inputs must be positive integers'						)

		lowerCamelCase_	:     int 						=      str(bin(lowerCAmelCase__						)						)
		binary_number += "0" * shift_amount
		return binary_number


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__							,lowerCAmelCase__						):
		if number < 0 or shift_amount < 0:
				raise ValueError('both inputs must be positive integers'						)

		lowerCamelCase_	:     Union[str, Any] 						=      str(bin(lowerCAmelCase__						)						)[2:]
		if shift_amount >= len(lowerCAmelCase__						):
				return "0b0"
		lowerCamelCase_	:     List[str] 						=      binary_number[: len(lowerCAmelCase__						) - shift_amount]
		return "0b" + shifted_binary_number


def 		_SCREAMING_SNAKE_CASE     ( lowerCAmelCase__							,lowerCAmelCase__						):
		if number >= 0:  # Get binary representation of positive number
				lowerCamelCase_	:     List[Any] 						=      '0' + str(bin(lowerCAmelCase__						)						).strip('-'						)[2:]
		else:  # Get binary (2's complement) representation of negative number
				lowerCamelCase_	:     Any 						=      len(bin(lowerCAmelCase__						)[3:]						)  # Find 2's complement of number
				lowerCamelCase_	:     List[str] 						=      bin(abs(lowerCAmelCase__						) - (1 << binary_number_length)						)[3:]
				lowerCamelCase_	:     List[str] 						=      (
				    '1' + '0' * (binary_number_length - len(lowerCAmelCase__						)) + binary_number
				)

		if shift_amount >= len(lowerCAmelCase__						):
				return "0b" + binary_number[0] * len(lowerCAmelCase__						)
		return (
		    "0b"
		    + binary_number[0] * shift_amount
		    + binary_number[: len(lowerCAmelCase__						) - shift_amount]
		)


if __name__ == "__main__":
		import doctest

		doctest.testmod()
