#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<ll,ll> P;
typedef modint998244353 mint;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a;i>=b;i--)
const ll inf=1e18;
const ll MAX_N=300005;
ll prime[MAX_N];
bool is_prime[MAX_N];
ll seive(ll n){
    ll p=0;
    for(ll i=0;i<=n;i++){
        is_prime[i]=true;
    }
    is_prime[0]=is_prime[1]=false;
    for(ll i=2;i<=n;i++){
        if(is_prime[i]){
            prime[p++]=i;
            for(ll j=2*i;j<=n;j+=i){
                is_prime[j]=false;
            }
        }
    }
    return p;
}
ll n;
ll ans;
ll pp;
ll cnt1[300005];
ll cnt2[300005];
int main(void){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cin>>n;
    ll p=seive(3*n);
    rep(i,0,p){
        if(prime[i]>n){
            pp=i;
            break;
        }
    }
    rep(i,0,pp){
        rep(j,0,pp){
            cnt1[prime[i]+prime[j]]++;
        }
    }
    rep(i,0,pp){
        rep(j,0,p){
            if(prime[j]-prime[i]>=0){
                cnt2[prime[j]-prime[i]]++;
            }
        }
    }
    rep(i,0,n*3+1){
        //cout<<i<<" "<<cnt1[i]<<" "<<cnt2[i]<<endl;
        ans+=cnt1[i]*cnt2[i];
    }
    rep(i,0,pp){
        rep(j,0,pp){
            if(is_prime[prime[i]*2+prime[j]]){
                ans-=3;
            }
        }
    }
    cout<<ans/6<<endl;

}