#include<bits/stdc++.h>
using namespace std;

int main(){
  int n;
  scanf("%d",&n);
  vector<bool> isPrime(3 * n + 1,true);
  for(int i = 2;i <= 3 * n;i++){
    if(isPrime.at(i)){
      for(int j = 2 * i;j <= 3 * n;j += i){
        isPrime.at(j) = false;
      }
    }
  }
  vector <int> Primes;
  for(int i = 3;i <= n;i++){
    if(isPrime.at(i)){
      Primes.push_back(i);
    }
  }
  int size = Primes.size();
  vector <int> GET(2 * Primes.back() + 1,0);
  long long int ans = 0;
  long long int minus = 0;
  for(int i = 0;i < size - 1;i++){
    int U = Primes.at(i);
    for(int j = i + 1;j < size;j++){
      int V = Primes.at(j);
      GET.at(U + V)++;
      if(isPrime.at(U + 2 * V)) minus++;
      if(isPrime.at(2 * U + V)) minus++;
    }
  }

  for(int i = 0;i < size;i++){
    int U = Primes.at(i);
    for(int j = 4; j <= 2 * Primes.back();j +=2){
      if(isPrime.at(U + j) && GET.at(j) > 0){
        ans += GET.at(j);
      }
    }
  }
  ans = (ans - minus) / 3;
  cout << ans << endl;
  return 0;
}