// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
#include "../debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}
    
ll N;

using TLL = tuple<ll, ll, ll>;

bool check(TLL t) {
    ll p, q, r;
    tie(p, q, r) = t;
    return 2 <= p && p <= N &&
           2 <= q && q <= N &&
           2 <= r && r <= N && p + q == r * r;
}

int main() {
    cin >> N;

    V<ll> primes;
    V<bool> used(2 * N + 10, false);
    for(ll i = 2; i < used.size(); i++) {
        if(used[i]) continue;
        primes.push_back(i);
        for(ll j = 1; i * j < used.size(); j++) used[i * j] = true;
    }

    V<TLL> ans = {
        { 2, 2, 2, },
    };

    for(ll r : primes) {
        ll p = 2;
        ll q = r * r - p;
        auto ite = lower_bound(ALL(primes), q);
        if(ite == primes.end()) continue;
        if(*ite != q) continue;
        ans.emplace_back(p, q, r);
        ans.emplace_back(q, p, r);
    }

    sort(ALL(ans));
    auto ite = unique(ALL(ans));
    ans.erase(ite, ans.end());

    ll cnt = 0;
    for(auto t : ans) cnt += check(t);
    cout << cnt << endl;
    return 0;
}