#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)








ll p[130010];
vector<ll> ps;

void f(ll n){
	ll i,j;
	for(i=2;i<=n;i++) p[i]=1;
	for(i=2;i<=n;i++){
		if(p[i]){
            ps.push_back(i);
			for(j=2*i;j<=n;j+=i) p[j]=0;
		}
	}
}






int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;



	f(130000);





	ll N;
	cin >> N;



	ll ans=0;
	for(i=0;;i++){
		if(ps[i]*ps[i]*ps[i]*ps[i]>N) break;
		for(j=i+1;;j++){
			if(ps[j]*ps[j]*ps[j]*ps[i]>N) break;
			for(ll k=j+1;;k++){
				if(ps[k]*ps[k]*ps[j]*ps[i]>N) break;
				for(ll r=k+1;;r++){
					if(ps[r]*ps[k]*ps[j]*ps[i]>N) break;

					ans++;
				}
			}
		}


	}


	cout << ans << endl;








	return 0;

}