



'''simple docstring'''






def        snake_case_   (	lowerCAmelCase_ = 10**6						)->						int:





       '''simple docstring'''


       if n <= 0:
              raise ValueError("""Please enter an integer greater than 0"""						)

       _UpperCAmelCase    :		Union[str, Any]     	=					list(range(n + 1						)						)
       for number in range(2			,  n + 1						):
              if phi[number] == number:
                     phi[number] -= 1
                     for multiple in range(number * 2			,  n + 1			,  lowerCAmelCase_						):
                            _UpperCAmelCase    :		Any     	=					(phi[multiple] // number) * (number - 1)

       _UpperCAmelCase    :		int     	=					1
       for number in range(1			,  n + 1						):
              if (answer / phi[answer]) < (number / phi[number]):
                     _UpperCAmelCase    :		str     	=					number

       return answer


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










"""simple docstring"""
from functools import lru_cache






@lru_cache
def    A__							(     UpperCamelCase			):
							if not isinstance(UpperCamelCase   ,    UpperCamelCase			):
														raise TypeError("k must be an integer."			)
							if k < 0:
														raise ValueError("k integer must be greater or equal to zero."			)
							if k == 0:
														return 0
							elif k == 1:
														return 1
							else:
														return fibonacci(k - 1			) + fibonacci(k - 2			)






def    A__							(     UpperCamelCase   ,    UpperCamelCase			):
							A						=    len(UpperCamelCase			)
							# Find m such that F_m >= n where F_i is the i_th fibonacci number.
							A						=    0
							while True:
														if fibonacci(UpperCamelCase			) >= len_list:
																					A						=    i
																					break
														i += 1
							A						=    0
							while fibb_k > 0:
														A						=    min(
														    offset + fibonacci(fibb_k - 1			)   ,    len_list - 1			)  # Prevent out of range
														A						=    arr[index_k]
														if item_k_1 == val:
																					return index_k
														elif val < item_k_1:
																					fibb_k -= 1
														elif val > item_k_1:
																					offset += fibonacci(fibb_k - 1			)
																					fibb_k -= 2
							else:
														return -1


if __name__ == "__main__":
		import doctest

		doctest.testmod()


