#include <iostream>
#include <cmath>
bool is_prime(unsigned long x)
{
unsigned long n = sqrt(x);
if (x%2 == 0) return false;
for(unsigned long i = 3; i <= n; i+=2)
{
if (x%i == 0)
{
return false;
}
}
return true;
}
int main()
{
for(int n = sqrt(106000000/2)-1; n < sqrt(107000001/2)+1; n++)
{
if (is_prime(n))
{
int m = n*n*2;
if (m <= 107000001 && m >= 106000000) std::cout << m << "\n";
}
}
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+Cgpib29sIGlzX3ByaW1lKHVuc2lnbmVkIGxvbmcgeCkKewogICAgdW5zaWduZWQgbG9uZyBuID0gc3FydCh4KTsKICAgIGlmICh4JTIgPT0gMCkgcmV0dXJuIGZhbHNlOwogICAgZm9yKHVuc2lnbmVkIGxvbmcgIGkgPSAzOyBpIDw9IG47IGkrPTIpCiAgICB7CiAgICAgICAgaWYgKHglaSA9PSAwKQogICAgICAgIHsKICAgICAgICAgICAgcmV0dXJuIGZhbHNlOwogICAgICAgIH0KICAgIH0KICAgIHJldHVybiB0cnVlOwp9CgoKaW50IG1haW4oKQp7CiAgICBmb3IoaW50IG4gPSBzcXJ0KDEwNjAwMDAwMC8yKS0xOyBuIDwgc3FydCgxMDcwMDAwMDEvMikrMTsgbisrKQogICAgewogICAgICAgIGlmIChpc19wcmltZShuKSkKICAgICAgICB7CiAgICAgICAgICAgIGludCBtID0gbipuKjI7CiAgICAgICAgICAgIGlmIChtIDw9IDEwNzAwMDAwMSAmJiBtID49IDEwNjAwMDAwMCkgc3RkOjpjb3V0IDw8IG0gPDwgIlxuIjsKICAgICAgICB9CiAgICB9Cn0K