
import math





def     _a					(						lowerCamelCase = 100							):
 lowerCamelCase		:	Union[str, Any]							=      sum(i * i for i in range(1,	n + 1							)							)
 lowerCamelCase		:	Union[str, Any]							=      int(math.pow(sum(range(1,	n + 1							)							),	2							)							)
 return square_of_sum - sum_of_squares


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






def     _a					(						lowerCamelCase = 100_0000							):
 lowerCamelCase		:	Any							=      set(range(3,	lowerCamelCase,	2							)							)
 primes.add(2							)
 for p in range(3,	lowerCamelCase,	2							):
  if p not in primes:
   continue
  primes.difference_update(set(range(p * p,	lowerCamelCase,	lowerCamelCase							)							)							)

 lowerCamelCase		:	Any							=      [float(lowerCamelCase							) for n in range(limit + 1							)]

 for p in primes:
  for n in range(lowerCamelCase,	limit + 1,	lowerCamelCase							):
   phi[n] *= 1 - 1 / p

 return int(sum(phi[2:]							)							)


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




