





def 						A_							(	_lowerCAmelCase = 100_0000	)		->					int:
 UpperCamelCase      :   int			      =  [i - 1 for i in range(limit + 1	)]

 for i in range(2				,  limit + 1	):
  if phi[i] == i - 1:
   for j in range(2 * i				,  limit + 1				,  _lowerCAmelCase	):
    phi[j] -= phi[j] // i

 return sum(phi[2 : limit + 1]	)


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







from typing import Any



def 						A_							(	_lowerCAmelCase	)		->					list[Any]:
 if not input_list:
  return []
 UpperCamelCase      :   List[str]			      =  [input_list.count(_lowerCAmelCase	) for value in input_list]
 UpperCamelCase      :   Dict			      =  max(_lowerCAmelCase	)  # Gets the maximum count in the input list.
 # Gets values of modes
 return sorted({input_list[i] for i, value in enumerate(_lowerCAmelCase	) if value == y}	)


if __name__ == "__main__":
    import doctest

    doctest.testmod()
