


import math





def   _UpperCAmelCase       (     UpperCAmelCase      :			int      ):
      """simple docstring"""




      assert isinstance(UpperCAmelCase						,	UpperCAmelCase      ) and (
          number >= 0
      ), "'number' must been an int and positive"

      if 1 < number < 4:
            # 2 and 3 are primes
            return True
      elif number < 2 or not number % 2:
            # Negatives, 0, 1 and all even numbers are not primes
            return False

      __lowerCamelCase     :      Union[str, Any]       						=						range(3						,	int(math.sqrt(UpperCAmelCase      ) + 1      )						,	2      )
      return not any(not number % i for i in odd_numbers      )





def   _UpperCAmelCase       (     UpperCAmelCase      :			Union[str, Any]						,	UpperCAmelCase      :			int=1						,	**UpperCAmelCase      :			int      ):
      """simple docstring"""




      __lowerCamelCase     :      str       						=						factor * value
      __lowerCamelCase     :      int       						=						value

      while not is_prime(UpperCAmelCase      ):
            value += 1 if not ("desc" in kwargs and kwargs["desc"] is True) else -1

      if value == first_value_val:
            return next_prime(value + 1						,	**UpperCAmelCase      )
      return value







def   _UpperCAmelCase       (     UpperCAmelCase      :			list      ):
      """simple docstring"""




      __lowerCamelCase     :      Optional[int]       						=						len(UpperCAmelCase      )
      for _ in range(UpperCAmelCase      ):
            for i in range(_ % 2						,	arr_size - 1						,	2      ):
                  if arr[i + 1] < arr[i]:
                        __lowerCamelCase						, __lowerCamelCase     :      List[str]       						=						arr[i + 1], arr[i]

      return arr


if __name__ == "__main__":
    __UpperCamelCase    :						str     =							list(range(10, 0, -1))
    print(F'''Original: {arr}. Sorted: {odd_even_transposition(arr)}''')



