#include<bits/stdc++.h>
using namespace std;
vector<bool> sieve(int n) {
    vector<bool> is_prime(n + 1, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i * i <= n; i++) {
        if (is_prime[i]) {
            for (int j = i * i; j <= n; j += i) {
                is_prime[j] = false;
            }
        }
    }
    return is_prime;
}

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

    vector<bool> is_prime = sieve(3 * x);

    int count = 0;

    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 && is_prime[sum]) {
                    count++;
                }
            }
        }
    }


    cout << count << endl;

}