





import sys

sys.set_int_max_str_digits(0)  # type: ignore


def      SCREAMING_SNAKE_CASE      (   lowerCAmelCase       ):
       _UpperCamelCase														=    [0] * 11
       _UpperCamelCase														=    [0] * 11

       # mark last 9 numbers
       for _ in range(9       ):
              _UpperCamelCase														=    1
              _UpperCamelCase														=    number // 10
       # flag
       _UpperCamelCase														=    True

       # check last 9 numbers for pandigitality

       for x in range(9       ):
              if not check_last[x + 1]:
                     _UpperCamelCase														=    False
       if not f:
              return f

       # mark first 9 numbers
       _UpperCamelCase														=    int(str(lowerCamelCase__       )[:9]       )

       for _ in range(9       ):
              _UpperCamelCase														=    1
              _UpperCamelCase														=    number // 10

       # check first 9 numbers for pandigitality

       for x in range(9       ):
              if not check_front[x + 1]:
                     _UpperCamelCase														=    False
       return f


def      SCREAMING_SNAKE_CASE      (   lowerCAmelCase       ):
       _UpperCamelCase														=    [0] * 11

       # mark last 9 numbers
       for _ in range(9       ):
              _UpperCamelCase														=    1
              _UpperCamelCase														=    number // 10
       # flag
       _UpperCamelCase														=    True

       # check last 9 numbers for pandigitality

       for x in range(9       ):
              if not check_last[x + 1]:
                     _UpperCamelCase														=    False
       return f


def      SCREAMING_SNAKE_CASE      (   ):
       _UpperCamelCase														=    1
       _UpperCamelCase														=    1
       _UpperCamelCase														=    2
       # temporary Fibonacci numbers

       _UpperCamelCase														=    1
       _UpperCamelCase														=    1
       _UpperCamelCase														=    2
       # temporary Fibonacci numbers mod 1e9

       # mod m=1e9, done for fast optimisation
       _UpperCamelCase														=    [0] * 1_000_000
       _UpperCamelCase														=    1_000_000_000

       for x in range(1_000_000       ):
              _UpperCamelCase														=    (aa + ba) % m
              _UpperCamelCase														=    ba % m
              _UpperCamelCase														=    ca % m
              if checka(lowerCamelCase__       ):
                     _UpperCamelCase														=    1

       for x in range(1_000_000       ):
              _UpperCamelCase														=    a + b
              _UpperCamelCase														=    b
              _UpperCamelCase														=    c
              # perform check only if in tocheck
              if tocheck[x + 3] and check(lowerCamelCase__       ):
                     return x + 3  # first 2 already done
       return -1


if __name__ == "__main__":
       print(F'''{solution() = }''')











"""simple docstring"""







def 	lowerCAmelCase__      (  lowerCamelCase__      )			->				List[str]:
							A    =       [701, 301, 132, 57, 23, 10, 4, 1]
							for gap in gaps:
														for i in range(lowerCamelCase__					,   len(lowerCamelCase__      )      ):
																					A    =       collection[i]
																					A    =       i
																					while j >= gap and collection[j - gap] > insert_value:
																												A    =       collection[j - gap]
																												j -= gap
																					if j != i:
																												A    =       insert_value
							return collection


if __name__ == "__main__":
							from doctest import testmod

							testmod()
							A     =      input('Enter numbers separated by a comma:\n').strip()
							A     =      [int(item) for item in user_input.split(',')]
							print(shell_sort(unsorted))



