





'''simple docstring'''




def 	UpperCAmelCase_							(					__lowercase							:      int = 100_0000       )		->       int:


     '''simple docstring'''



     _UpperCAmelCase     							=   [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			,     __lowercase       ):
                    phi[j] -= phi[j] // i

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


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











'''simple docstring'''




import math
def 	UpperCAmelCase_							(					__lowercase							:      int       )		->       bool:


     '''simple docstring'''



     return math.sqrt(__lowercase       ) * math.sqrt(__lowercase       ) == num
def 	UpperCAmelCase_							(					__lowercase							:      int       )		->       bool:


     '''simple docstring'''



     _UpperCAmelCase     							=   0
     _UpperCAmelCase     							=   n
     while left <= right:
          _UpperCAmelCase     							=   (left + right) // 2
          if mid**2 == n:
               return True
          elif mid**2 > n:
               _UpperCAmelCase     							=   mid - 1
          else:
               _UpperCAmelCase     							=   mid + 1
     return False


if __name__ == "__main__":
  import doctest

  doctest.testmod()




