



import sys



def  _lowerCAmelCase     (_lowerCAmelCase ,						_lowerCAmelCase):
					if not numbers:
										return 0
					if target == 0 and target in numbers:
										return 0
					if not isinstance(_lowerCAmelCase ,						(list, tuple)) or not all(
					    isinstance(_lowerCAmelCase ,						_lowerCAmelCase) for number in numbers):
										raise ValueError("numbers must be an iterable of integers")

					UpperCamelCase_			= UpperCamelCase_			= UpperCamelCase_			= 0
					UpperCamelCase_			= sys.maxsize

					while right < len(_lowerCAmelCase):
										curr_sum += numbers[right]
										while curr_sum >= target and left <= right:
															UpperCamelCase_			= min(_lowerCAmelCase ,						right - left + 1)
															curr_sum -= numbers[left]
															left += 1
										right += 1

					return 0 if min_len == sys.maxsize else min_len

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())




