#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------
constexpr int MX = 5e5+3;
int n;
bool visited[MX];

vector<int> prime() {
    vector<int> ans;
    for(int i=2; i<=MX;i++) {
        if(visited[i]) continue;
        ans.push_back(i);
        for(int j=i+i; j<MX; j+=i) {
            visited[j] = true;
        }
    }
    return ans;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    cin >> n;
    auto primes = prime();
    unordered_map<int, int> mp;
    for(auto &e: primes) {
        mp[e] ++;
    }

    int ans = 0;
    for(auto &r: primes) {
        if(r > min(1000, n)) break;
        for(auto &p: primes) {
            if(p > n) break;
            if(mp[r*r-p] > 0 and r*r-p <= n) ans++;
        }
    }
    cout << ans << endl;
    return 0;
}