def search():
circularprimes = []
for n in range(2, 1000000):
c = circulars(n)
AllPrime = True
for x in c:
AllPrime = AllPrime and isprime(x) and not x in circularprimes
if AllPrime:
for x in c:
circularprimes.append(x)
print len(circularprimes)
print circularprimes
def is_circular_prime(n):
return all([p in primes for p in circulars(n)])
