import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.PriorityQueue;
import java.math.BigInteger;
    
public class Main{

static final InputStream in=System.in;
static final PrintWriter out=new PrintWriter(System.out);
static final int INF=Integer.MAX_VALUE/2;
static final long LINF=Long.MAX_VALUE/2;
static final int MAX_N=1000000000;
    
public static void main(String[] args) throws IOException{
InputReader ir=new InputReader(in);
int ans=0;
int n=ir.nextInt();
long[] productOfFermatPrimeNumbers={1,3,5,17,257,65537,3*5,3*17,3*257,3*65537,5*17,5*257,5*65537,17*257,17*65537,257*65537,3*5*17,3*5*257,3*5*65537,3*17*257,3*17*65537,3*257*65537,5*17*257,5*17*65537,5*257*65537,17*257*65537,3*5*17*257,3*5*17*65537,3*5*257*65537,3*17*257*65537,5*17*257*65537,3*5*17*257*65537};
int[] count=new int[MAX_N+1];
for(int i=0;i<productOfFermatPrimeNumbers.length;i++){
if(productOfFermatPrimeNumbers[i]>MAX_N) continue;
int t=(int)productOfFermatPrimeNumbers[i];
for(int j=0;;j++){
if((int)Math.pow(2,j)*t>MAX_N) break;
count[(int)Math.pow(2,j)*t]++;
}
}
for(int i=3;i<=n;i++) if(count[i]>0) ans++;
out.println(ans);
out.flush();
}

static class InputReader {
private InputStream in;
private byte[] buffer=new byte[1024];
private int curbuf;
private int lenbuf;

public InputReader(InputStream in) {this.in=in;}
  
public int readByte() {
if(lenbuf==-1) throw new InputMismatchException();
if(curbuf>=lenbuf){
curbuf= 0;
try{
lenbuf=in.read(buffer);
}
catch (IOException e) {
throw new InputMismatchException();
}
if(lenbuf<=0)
return -1;
}
return buffer[curbuf++];
}

public boolean isSpaceChar(int c){return !(c>=33&&c<=126);}

private int skip() {int b; while((b = readByte())!=-1&&isSpaceChar(b)); return b;}

public String next() {
int b=skip();
StringBuilder sb=new StringBuilder();
while(!isSpaceChar(b)){
sb.appendCodePoint(b);
b=readByte();
}
return sb.toString();
}
 
public int nextInt() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
int res=0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public long nextLong() {
int c=readByte();
while (isSpaceChar(c)) c=readByte();
boolean minus=false;
if (c=='-') {
minus=true;
c=readByte();
}
long res = 0;
do{
if(c<'0'||c>'9') throw new InputMismatchException();
res=res*10+c-'0';
c=readByte();
}while(!isSpaceChar(c));
return (minus)?-res:res;
}

public int[] toIntArray(int n){
int[] a=new int[n];
for(int i=0;i<n;i++) a[i]=nextInt();
return a;
}
}
}