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

// Function to check if a number is prime
bool isPrime(int n) {
    if (n <= 1) return false;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) return false;
    }
    return true;
}

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

    // Precompute prime numbers up to 3x using sieve
    vector<bool> prime(3 * x + 1, true);
    prime[0] = prime[1] = false; // 0 and 1 are not prime numbers

    for (int i = 2; i * i <= 3 * x; i++) {
        if (prime[i]) {
            for (int j = i * i; j <= 3 * x; j += i) {
                prime[j] = false;
            }
        }
    }

    int count = 0;

    // Iterate through all triplets (a, b, c)
    for (int a = 1; a <= x; a++) {
        for (int b = 1; b <= x; b++) {
            for (int c = 1; c <= x; c++) {
                int sum = a + b + c;
                if (sum <= x && prime[sum]) {
                    count++;
                }
            }
        }
    }

    cout << count << endl;

    return 0;
}