import euler

import os

def primeGenerator(n):

for i in xrange(2, n ):

if euler.isprime(i):

yield i

def rotations(n):

return res

cnt = 0

for p in primeGenerator( 1000000 ):

allprime = True

for rot in rotations(p):

if not euler.isprime(rot):

allprime = False

break

if allprime:

cnt += 1

print p,cnt,rotations(p),allprime

print 'soln',cnt