/*
 *   Copyright (c) 2025 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n; cin >> n; 
    vector<int> prime;
    prime.push_back(2);
    for(int num=3;num<=n;num++)
    {
        int sq = sqrt(num);
        bool p = true;
        for(int j=2;j<=sq;j++)
        {
            if(num%j==0)
            {
                p = false;
                break;
            }
        }
        if(p) prime.push_back(num);
    }

    int ans = 0;
    for(int a=1;a<=n-2;a++)
    {
        for(int b=1;b<=n-2;b++)
        {
            int climit = n-a-b;
            for(auto e:prime)
            {
                if(e<=n && e-a-b>0) ++ans;
            }
        }
    }
    cout<<ans<<'\n';
}