def is_prime(n):
if n%2 == 0: return False
i = 3
while(i*i <= n):
if n%i == 0: return False
i = i+2
return True
def lp(n):
p = int((n//2)**0.5)
if p%2 == 0: p = p + 1
return p
def nums(m,n):
p = lp(m)
q = lp(n)
while(p <= q):
if is_prime(p):
print(2*p*p)
p = p + 2
nums(101000000,102000000)
ZGVmIGlzX3ByaW1lKG4pOgogICAgaWYgbiUyID09IDA6IHJldHVybiBGYWxzZQogICAgaSA9IDMKICAgIHdoaWxlKGkqaSA8PSBuKToKICAgICAgICBpZiBuJWkgPT0gMDogcmV0dXJuIEZhbHNlCiAgICAgICAgaSA9IGkrMgogICAgcmV0dXJuIFRydWUKCmRlZiBscChuKToKICAgIHAgPSBpbnQoKG4vLzIpKiowLjUpCiAgICBpZiBwJTIgPT0gMDogcCA9IHAgKyAxCiAgICByZXR1cm4gcAoKZGVmIG51bXMobSxuKToKICAgIHAgPSBscChtKQogICAgcSA9IGxwKG4pCiAgICB3aGlsZShwIDw9IHEpOgogICAgICAgIGlmIGlzX3ByaW1lKHApOiAKICAgICAgICAgICAgcHJpbnQoMipwKnApCiAgICAgICAgcCA9IHAgKyAyCgpudW1zKDEwMTAwMDAwMCwxMDIwMDAwMDApCg==