




'''simple docstring'''



from __future__ import annotations







def      _UpperCamelCase	(_lowerCamelCase							:       int		)->				list[int]:




     '''simple docstring'''





     __snake_case         =					[0] * max_one

     for i in range(0				,		_lowerCamelCase		):
          __snake_case         =					i

     for i in range(2				,		_lowerCamelCase		):
          if totients[i] == i:
               for j in range(_lowerCamelCase				,		_lowerCamelCase				,		_lowerCamelCase		):
                    totients[j] -= totients[j] // i

     return totients







def      _UpperCamelCase	(_lowerCamelCase							:       int				,		_lowerCamelCase							:       int		)->				bool:




     '''simple docstring'''





     return sorted(str(_lowerCamelCase		)		) == sorted(str(_lowerCamelCase		)		)







def      _UpperCamelCase	(_lowerCamelCase							:       int = 10_00_00_00		)->				int:




     '''simple docstring'''





     __snake_case         =					1  # i
     __snake_case         =					0  # φ(i)
     __snake_case         =					get_totients(max_n + 1		)

     for i in range(2				,		max_n + 1		):
          __snake_case         =					totients[i]

          if i * min_denominator < min_numerator * t and has_same_digits(_lowerCamelCase				,		_lowerCamelCase		):
               __snake_case         =					i
               __snake_case         =					t

     return min_numerator


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












'''simple docstring'''



def      _UpperCamelCase	(_lowerCamelCase							:       list				,		_lowerCamelCase							:       int		)->				int:




     '''simple docstring'''





     for index, item in enumerate(_lowerCamelCase		):
          if item == target:
               return index
     return -1







def      _UpperCamelCase	(_lowerCamelCase							:       list				,		_lowerCamelCase							:       int				,		_lowerCamelCase							:       int				,		_lowerCamelCase							:       int		)->				int:




     '''simple docstring'''





     if not (0 <= high < len(_lowerCamelCase		) and 0 <= low < len(_lowerCamelCase		)):
          raise Exception('''Invalid upper or lower bound!'''		)
     if high < low:
          return -1
     if sequence[low] == target:
          return low
     if sequence[high] == target:
          return high
     return rec_linear_search(_lowerCamelCase				,		low + 1				,		high - 1				,		_lowerCamelCase		)


if __name__ == "__main__":
     UpperCAmelCase_    :					List[Any]					      =						input('''Enter numbers separated by comma:\n''').strip()
     UpperCAmelCase_    :					Optional[int]					      =						[int(item.strip()) for item in user_input.split(''',''')]

     UpperCAmelCase_    :					List[str]					      =						int(input('''Enter a single number to be found in the list:\n''').strip())
     UpperCAmelCase_    :					Optional[int]					      =						linear_search(sequence, target)
     if result != -1:
          print(F"""linear_search({sequence}, {target}) = {result}""")
     else:
          print(F"""{target} was not found in {sequence}""")






