#include <iostream>
#include <cmath>
using namespace std;

bool isPrime(int n){
    if (n <= 1)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;

    int num = sqrt(n);
    for (int i = 3; i <= num; i += 2)
    {
        if (n % i == 0)
            return false;
    }

    return true;
}

int main(){
    int n; cin >> n;

    int count = 0;
    for(int p = 2; p <= n; p++){
        for(int r = 2; r <= n; r++){
            int q = (r * r) - p;
            if(q >= 2 && q <= n && isPrime(p) && isPrime(q) && isPrime(r)){
                //cout << "( " << p << " , " << q << " , " << r << " )" << endl;
                count++;
            }
        }
    }

    cout << count << endl;

}