





from __future__ import annotations

# This is the precision for this function which can be altered.
# It is recommended for users to keep this number greater than or equal to 10.
lowercase    : str    	=  10


def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase					):
       for i in range(lowerCAmelCase    ,       lowerCAmelCase					):
              if array[i] == target:
                     return i
       return -1


def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase    ,       lowerCAmelCase					):
       _UpperCamelCase              =						0
       _UpperCamelCase              =						len(lowerCAmelCase					)
       while left <= right:
              if right - left < precision:
                     return lin_search(lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase					)

              _UpperCamelCase              =						(left + right) // 3 + 1
              _UpperCamelCase              =						2 * (left + right) // 3 + 1

              if array[one_third] == target:
                     return one_third
              elif array[two_third] == target:
                     return two_third

              elif target < array[one_third]:
                     _UpperCamelCase              =						one_third - 1
              elif array[two_third] < target:
                     _UpperCamelCase              =						two_third + 1

              else:
                     _UpperCamelCase              =						one_third + 1
                     _UpperCamelCase              =						two_third - 1
       else:
              return -1


def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase					):
       if left < right:
              if right - left < precision:
                     return lin_search(lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase					)
              _UpperCamelCase              =						(left + right) // 3 + 1
              _UpperCamelCase              =						2 * (left + right) // 3 + 1

              if array[one_third] == target:
                     return one_third
              elif array[two_third] == target:
                     return two_third

              elif target < array[one_third]:
                     return rec_ternary_search(lowerCAmelCase    ,       one_third - 1    ,       lowerCAmelCase    ,       lowerCAmelCase					)
              elif array[two_third] < target:
                     return rec_ternary_search(two_third + 1    ,       lowerCAmelCase    ,       lowerCAmelCase    ,       lowerCAmelCase					)
              else:
                     return rec_ternary_search(one_third + 1    ,       two_third - 1    ,       lowerCAmelCase    ,       lowerCAmelCase					)
       else:
              return -1


if __name__ == "__main__":
       import doctest

       doctest.testmod()

       lowercase    : int    	=  input("""Enter numbers separated by comma:\n""").strip()
       lowercase    : Dict    	=  [int(item.strip()) for item in user_input.split(""",""")]
       assert collection == sorted(collection), F"List must be ordered.\n{collection}."
       lowercase    : Union[str, Any]    	=  int(input("""Enter the number to be found in the list:\n""").strip())
       lowercase    : List[Any]    	=  ite_ternary_search(collection, target)
       lowercase    : Optional[int]    	=  rec_ternary_search(0, len(collection) - 1, collection, target)
       if resulta != -1:
              print(F'''Iterative search: {target} found at positions: {resulta}''')
              print(F'''Recursive search: {target} found at positions: {resulta}''')
       else:
              print("""Not found""")













def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase = 1_000					):
       _UpperCamelCase              =						3
       _UpperCamelCase              =						0
       while a < n:
              if a % 3 == 0 or a % 5 == 0:
                     result += a
              elif a % 15 == 0:
                     result -= a
              a += 1
       return result


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






