# Solve google challenge 01
# Find first 10 digit prime from the digits of e

import real
from PrimeCheck import isPrime

digits = 1000
e = real.e(digits) #compute e to n digits
strDigitsOfE = str(e)[2:-3] #Omit first 2 "2." and last 3 "+-2"


#Take every 10 digits and check for prime
for startDigitPlace in range(digits-10): #can't select 10 digits from n-9th place 
    #select blocks of every 10 digits and check for prime
    if isPrime(int(strDigitsOfE[startDigitPlace:startDigitPlace+10])):
        print strDigitsOfE[startDigitPlace:startDigitPlace+10]," | Position: ",startDigitPlace