def solve():
    n = 2*10**6
    p = prime_generator(n)
    s = 0
    for x in p:
        s+=x
    return s
def solve():
    p = prime_generator(2000000)
    count = 0
    for n in p:
        count+=1
        if count == 10001:
            return n