#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";
        }
    }
}