
import sys







def 				A__    (  lowerCamelCase   ,			lowerCamelCase  )     ->		int:
				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_:							Any		=  0
				UpperCamelCase_:							int		=  sys.maxsize

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

				return 0 if min_len == sys.maxsize else min_len













from itertools import permutations






def 			lowerCamelCase__	():
     _SCREAMING_SNAKE_CASE				:		Dict  			=							list(map("".join,				permutations("0123456789"		)		)		)
     return result[999999]


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