Euler project37

#-*- coding:utf-8 -*-
sum=0
dictionary=['0','4','6','8']
prime_count=0
max=11

#素数判定
def prime(x):
	if x<2: return False
 	if x==2 : return True
	if x%2==0: return False
	a=3
	while a**2 <= x:
		if x%a==0: return False
		a=a+2
	return True

if __name__=="__main__":
	count=10
	while prime_count < max:
		count+=1
		countM=str(count)
		if any([i in dictionary for i in list(countM) ])==False:
			judge=1
			for i in range(len(countM)):
				if prime(int(countM[i:len(countM)]))==False:
					judge=0
					break
				if prime(int(countM[:i+1]))==False:
					judge=0
					break
			if judge==1:
				prime_count+=1
				sum+=count
	print sum