



"""simple docstring"""




def 				_lowerCAmelCase      ():
					UpperCamelCase_											=				1

					while True:
										if (
										    sorted(str(lowercase_))
										    == 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())





def 				_lowerCAmelCase      (_lowerCAmelCase				,		_lowerCAmelCase):
					UpperCamelCase_											=				0
					for ele in arr:
										total_sum += product_sum(_lowerCAmelCase				,		depth + 1) if isinstance(_lowerCAmelCase				,		_lowerCAmelCase) else ele
					return total_sum * depth



def 				_lowerCAmelCase      (_lowerCAmelCase):
					return product_sum(_lowerCAmelCase				,		1)


if __name__ == "__main__":
	import doctest

	doctest.testmod()
