N = 10 ** 7 pr = get_prime(N // 2) ans = 0 for i inrange(len(pr) - 1): for j inrange(i + 1, len(pr)): if pr[i] * pr[j] > N: break mx = 0 x = pr[i] while x * pr[j] <= N: y = pr[j] while x * y <= N: mx = max(mx, x * y) y *= pr[j] x *= pr[i] ans += mx print(ans)