#include <iostream>
#include <stdio.h>
bool remark[1000];
int prime[1001];
int primesize;
using namespace std;
int main()
{
int i,j;
for(i=0;i<=1000;i++){
remark[i]=false;
}
for(i=2;i<=1000;i++){
if(remark[i]==true) continue;
prime[primesize++]=i;
for(j=i*i;j<=1000;j+=i){
remark[j]=true;
}
}
int n;
scanf("%d",&n);
int ans=0;
for(int i=0;prime[i]<n;i++){
ans++;
}
printf("%d",ans/2);
return 0;
#include <stdio.h>
bool remark[1000];
int prime[1001];
int primesize;
using namespace std;
int main()
{
int i,j;
for(i=0;i<=1000;i++){
remark[i]=false;
}
for(i=2;i<=1000;i++){
if(remark[i]==true) continue;
prime[primesize++]=i;
for(j=i*i;j<=1000;j+=i){
remark[j]=true;
}
}
int n;
scanf("%d",&n);
int ans=0;
for(int i=0;prime[i]<n;i++){
ans++;
}
printf("%d",ans/2);
return 0;
}
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
bool isPrime(int n){
if(n <=1) return false;
int sqr=(int) sqrt(1.0 * n);
for(int i=2;i<=sqr;i++){
if(n%i==0) return false;
}
return true;
}
int main(int argc, char** argv) {
int n,count=0;
scanf("%d",&n);
for(int i=3;i+2<=n;i+=2){
if(isPrime(i) ==true && isPrime(i+2)==true) count++;
}
printf("%d",count);
return 0;
}