#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(a);i>(b);--i)
#define eper(i,a,b) for(int i=(a);i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<30)-1
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
#define vii vector<int>
#define vll vector<long long>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

static const int MAX_PRIME = 1000000;
bool is_prime[MAX_PRIME];
int primes[MAX_PRIME], prime_cnt;
void make_prime(int N)
{
    erep(i, 0, N) is_prime[i] = true;
    is_prime[0] = false;
    is_prime[1] = false;
    erep(i, 2, N)
    {
        if (is_prime[i])
            primes[prime_cnt++] = i;
        for (int j = 2 * i; j <= N; j += i)
            is_prime[j] = false;
    }
}

int n, cnt[400001];
ll ans;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
    cin >> n;
    make_prime(3*n + 1);
    int a, b, c;
    for (c = 2; primes[c] <= n; c++) {
        b = c - 1;
        rep(a, 0, b) cnt[primes[a] + primes[b]]++;
        for(int t = c + 1; primes[t] <= primes[c] * 3; t++) 
            ans += cnt[primes[t] - primes[c]];  
    } 
    cout << ans << endl;
    return 0;
}