void solve(std::istream& in, std::ostream& out) {
int n;
while(in>>n){
int ans = 1;
ans = Eular(n);
if(ans&1);
else ans/=2;
out<<ans<<endl;
}
}
int main()
{
Eular();
int n;
while(scanf("%d",&n)!= EOF)
{
int ans = 1;
}
}
int main()
{
Eular();
int n;
scanf("%d",&n);
int ans = 0;
for(int i = 0; i < totp; i++)
if(prime[i] <= n)
ans++;
printf("%d\n", ans);
}
int main()
{
Eular();
init();
//printf("%d\n", totp);
// SMALL
long long st = 1LL << 15LL;
st += 1LL;
long long ed = 1LL << 16LL;
totans = 0;
puts("Case #1:");
for(long long i = st; i < ed; i += 2)
{
if(totans < 50)
tryto(i);
}
}
