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

int64_t solve(int64_t n)
{
	auto is_prime = [](int64_t x) {
		if (x < 2)
		{
			return false;
		}
		if (x == 2)
		{
			return true;
		}
		for (int64_t i = 2; i * i <= x; i++)
		{
			if (x % i == 0)
			{
				return false;
			}
		}
		return true;
	};
	vector<int64_t> ps;
	ps.emplace_back(2);
	for (int64_t i = 3; i <= n; i += 2)
	{
		if (is_prime(i))
		{
			ps.emplace_back(i);
		}
	}
	int64_t ans = 0, m = ps.size();
	vector<vector<vector<bool>>> puni(10000, vector<vector<bool>>(4, vector<bool>(300000, false)));
	puni[0][0][0] = true;
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			for (int k = 0; k < 300000; k++)
			{
				puni[i + 1][j][k] = puni[i + 1][j][k] || puni[i][j][k];
				if (k + ps[i] < 300000)
				{
					puni[i + 1][j + 1][k + ps[i]] = puni[i + 1][j + 1][k + ps[i]] || puni[i][j][k];
				}
			}
		}
	}
	for (int k = 0; k < 300000; k++)
	{
		if (is_prime(k) && puni[m][3][k])
		{
			ans++;
		}
	}
	return ans;
}

int main()
{
	int64_t n;
	cin >> n;
	cout << solve(n) << endl;
	return 0;
}