def prime(n):
    if (n==2): return True
    elif (n==1 or (n!=2 and n%2==0)): return False
    else:
        for i in range(3,int(n**0.5)+1,2):
            if n%i==0:
                return False
        return True
count=0
n=int(input())
L=[0 for i in range(1,n+1)]
for i in range(2,n):
    if prime(i)==True:
        L[i-1]=1
        if L[i%10000-1]==1 and L[i%1000-1]==1 and L[i%100-1]==1 and L[i%10-1]==1:
            count+=1
print(count)

ZGVmIHByaW1lKG4pOgogICAgaWYgKG49PTIpOiByZXR1cm4gVHJ1ZQogICAgZWxpZiAobj09MSBvciAobiE9MiBhbmQgbiUyPT0wKSk6IHJldHVybiBGYWxzZQogICAgZWxzZToKICAgICAgICBmb3IgaSBpbiByYW5nZSgzLGludChuKiowLjUpKzEsMik6CiAgICAgICAgICAgIGlmIG4laT09MDoKICAgICAgICAgICAgICAgIHJldHVybiBGYWxzZQogICAgICAgIHJldHVybiBUcnVlCmNvdW50PTAKbj1pbnQoaW5wdXQoKSkKTD1bMCBmb3IgaSBpbiByYW5nZSgxLG4rMSldCmZvciBpIGluIHJhbmdlKDIsbik6CiAgICBpZiBwcmltZShpKT09VHJ1ZToKICAgICAgICBMW2ktMV09MQogICAgICAgIGlmIExbaSUxMDAwMC0xXT09MSBhbmQgTFtpJTEwMDAtMV09PTEgYW5kIExbaSUxMDAtMV09PTEgYW5kIExbaSUxMC0xXT09MToKICAgICAgICAgICAgY291bnQrPTEKcHJpbnQoY291bnQp

MTAwMDAwMA==

1000000