def is_prime(n):
    """
    A^n - B^n - 1 divided by n where A+B = n and A-B = n
    if n can divide A^n - B^n - 1 evenly then n is a prime or pseudo prime
    as long as A+B = n and A-B = 1
    """
    B = n / 2
    A = B + 1
    return (((A**n - B**n - 1) % n) == 0)
 
def main():
    x = 2
    print(str(x)+','),
    x = 3
    while x <= 341:
        if is_prime(x):
            print(str(x)+','),
        x += 2
 
if __name__ == "__main__":
    main()
 

ZGVmIGlzX3ByaW1lKG4pOgogICAgIiIiCiAgICBBXm4gLSBCXm4gLSAxIGRpdmlkZWQgYnkgbiB3aGVyZSBBK0IgPSBuIGFuZCBBLUIgPSBuCiAgICBpZiBuIGNhbiBkaXZpZGUgQV5uIC0gQl5uIC0gMSBldmVubHkgdGhlbiBuIGlzIGEgcHJpbWUgb3IgcHNldWRvIHByaW1lCiAgICBhcyBsb25nIGFzIEErQiA9IG4gYW5kIEEtQiA9IDEKICAgICIiIgogICAgQiA9IG4gLyAyCiAgICBBID0gQiArIDEKICAgIHJldHVybiAoKChBKipuIC0gQioqbiAtIDEpICUgbikgPT0gMCkKCmRlZiBtYWluKCk6CiAgICB4ID0gMgogICAgcHJpbnQoc3RyKHgpKycsJyksCiAgICB4ID0gMwogICAgd2hpbGUgeCA8PSAzNDE6CiAgICAgICAgaWYgaXNfcHJpbWUoeCk6CiAgICAgICAgICAgIHByaW50KHN0cih4KSsnLCcpLAogICAgICAgIHggKz0gMgoKaWYgX19uYW1lX18gPT0gIl9fbWFpbl9fIjoKICAgIG1haW4oKQo=