






def      _snake_case     (__lowercase = 1000000):
   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())













import numpy as np






def      _snake_case     (__lowercase):
   return 1 / (1 + np.exp(-vector))






def      _snake_case     (__lowercase):
   return vector * sigmoid(__lowercase)


if __name__ == "__main__":
 import doctest

 doctest.testmod()





