# This file was *autogenerated* from the file search_q.sage.
from sage.all_cmdline import *   # import sage library
_sage_const_3 = Integer(Integer(3)); _sage_const_2 = Integer(Integer(2)); _sage_const_1 = Integer(Integer(1)); _sage_const_0 = Integer(Integer(0)); _sage_const_60 = Integer(Integer(60)); _sage_const_10000 = Integer(Integer(10000)); _sage_const_17 = Integer(Integer(17))
import sys
Dlist = [int(p) for p in sys.argv[_sage_const_1 :]]

#Dlist = [-1, 2]
for p in primes(max(Dlist)+_sage_const_2 , _sage_const_10000 ):
    good = True
    if QuadraticField(-_sage_const_3  * p, 'a').class_number() % _sage_const_3  == _sage_const_0 :
        continue
    if p % _sage_const_60  == _sage_const_17 :
        print p
    for D in subsets(Dlist):
        if QuadraticField(-_sage_const_3  * prod(D) * p, 'a').class_number() % _sage_const_3  == _sage_const_0 :
            good = False
            break
    if good:
        Dlist += [p]
        print "good", Dlist