var i,k,n:longint;
    f,g:text;
function prim(i:longint):boolean;
var j:longint;
    b:boolean;
begin
j:=2;
b:=true;
while (j<=i div 2)and b do
begin
 b:=i mod j<>0;
 j:=j+1;
end;
prim:=b;
end;
begin
assign(f,'ciur.in');
assign(g,'ciur.out');
reset(f);
rewrite(g);
read(f,n);
i:=3;
k:=1;
while i<=n do
begin
 if prim(i) then k:=k+1;
 i:=i+2;
end;
write(g,k);
close(f);
close(g);
end.