from collections import Counter

N=int(input())

x=N*3

# x以下の素数の列挙,素因数分解,約数の列挙
    
import math 
L=math.floor(math.sqrt(x)) # 平方根を求める

Primelist=[i for i in range(x+1)]
Primelist[1]=0 # 1は素数でないので0にする.
 
for i in Primelist:
    if i>L:
        break
    if i==0:
        continue
    for j in range(2*i,x+1,i):
        Primelist[j]=0

Primes=[Primelist[j] for j in range(x+1) if Primelist[j]!=0]


PP=[]
MP=[]

for i in range(len(Primes)):
    if Primes[i]>N:
        break
    for j in range(i+1,len(Primes)):
        MP.append(Primes[j]-Primes[i])

C=Counter(MP)

ANS=0

for j in range(len(Primes)):
    if Primes[j]>N:
        break
    for i in range(j+1,len(Primes)):
        C[Primes[i]-Primes[j]]-=1

    #print(Primes[j],C,ANS)

    for i in range(j):
        x=Primes[i]+Primes[j]
        #print(x,C[x])

        ANS+=C[x]

print(ANS)