#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e18)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))


vector<ll> make_p(ll x){
	vector<bool> isp(x+1,true);
	isp[0]=isp[1]=false;
	for(ll i=2;i*i<=x;i++){
		if(isp[i]){
			for(ll j=2*i;j<=x;j+=i){
				isp[j] = false;
			}
		}
	}
	vector<ll> res;
	for(ll i=2;i<=x;i++){
		if(isp[i])res.push_back(i);
	}
	return res;
}


int main(){
	ll N;
	cin >> N;
	auto p = make_p(N);
	vector<ll> p2;
	set<ll> sep;
	for(auto x:p){
		ll a = x;
		sep.insert(a);
		if(a*a>2*N)continue;
		p2.push_back(a*a);
	}
	int ans = 0;
	for(auto x:p2){
		for(auto y:p){
			if(sep.count(x-y))ans++;
		}
	}
	cout << ans << endl;
}