解法：

def check(n):
a=str(n)
b=a:-1
return ab
def prime(n):
if n<2:
return 0
for i in range(2,n):
if n %i0:
return 0
return 1
x=int(input())
cnt=0
for i in range(11,x+1):
if check(i) and prime(i):
cnt+=1
print(cnt)