#include <bits/stdc++.h>

using namespace std;

using ll = long long;

vector<int> sieve(int n, vector<bool>& is_prime) {
    vector<int> res;
    is_prime.assign(n + 1, true);
    is_prime[0] = false;
    is_prime[1] = false;
    for (int i = 2; i <= n; i++) {
        if (!is_prime[i]) continue;
        res.emplace_back(i);
        for (int j = 2 * i; j <= n; j += i) is_prime[j] = false;
    }
    return res;
}

ll solve(int n) {
    vector<bool> is_prime;
    vector<int> v = sieve(n * 3, is_prime);
    vector<ll> cnt(n * 3 + 1, 0);
    ll res = 0;
    for (int i = 0; i < v.size(); i++) {
        if (v[i] > n) break;

        for (int j = i + 1; j < v.size(); j++) {
            res += cnt[v[j] - v[i]];
        }

        for (int j = 0; j < i; j++) {
            cnt[v[i] + v[j]]++;
        }
    }
    return res;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    cout << solve(n) << endl;
    return 0;
}