def 	__lowerCamelCase							(				__a    : int		)      ->       str:
	if not isinstance(__a      ,							__a		):
		_lowercase   =(
		    "operation can not be conducted on a object of type "
		    f'''{type(__a		).__name__}'''
		)
		raise TypeError(__a		)
	_lowercase   =""
	for _ in range(0      ,							32		):
		bit_string += str(number % 2		)
		_lowercase   =number >> 1
	return bit_string

def 	__lowerCamelCase							(				__a    : int		)      ->       str:
	if number < 0:
		raise ValueError("the value of input must be positive"		)
	elif isinstance(__a      ,							__a		):
		raise TypeError("Input value must be a 'int' type"		)
	elif isinstance(__a      ,							__a		):
		raise TypeError("'<' not supported between instances of 'str' and 'int'"		)
	_lowercase   =0
	# iterator over [1 to 32],since we are dealing with 32 bit integer
	for _ in range(1      ,							33		):
		# left shift the bits by unity
		_lowercase   =result << 1
		# get the end bit
		_lowercase   =number % 2
		# right shift the bits by unity
		_lowercase   =number >> 1
		# add that bit to our ans
		_lowercase   =result | end_bit
	return get_reverse_bit_string(__a		)


if __name__ == "__main__":
						import doctest

						doctest.testmod()





def 	__lowerCamelCase							(				)      ->       Dict:
	_lowercase   =1

	while True:
		if (
		    sorted(str(__a		)		)
		    == sorted(str(2 * i		)		)
		    == sorted(str(3 * i		)		)
		    == sorted(str(4 * i		)		)
		    == sorted(str(5 * i		)		)
		    == sorted(str(6 * i		)		)
		):
			return i

		i += 1


if __name__ == "__main__":
						print(solution())




