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 <= 4200:
        if is_prime(x):
            print(str(x)+','),
        x += 2

if __name__ == "__main__":
    main()