import scala.io.StdIn.readLine
import scala.collection.mutable.PriorityQueue
import scala.annotation.tailrec

// PriorityQueue[Long]()(scala.math.Ordering.Long.reverse)
object Lib {
  // object Number {
  //   // @return Array length is equal to 'n'.
  //   //  Kth element of Array is true if K is prime else false.
  //   final def sieve(n : Int) : Array[Boolean] = {
  //     val isprime = Array.fill(n+1)(true)
  //     isprime(0) = false
  //     isprime(1) = false
  //     for(i <- 2 to Math.ceil(Math.sqrt(n.toDouble)).toInt;
  //         if isprime(i);
  //         j <- i*i to n by i){
  //       isprime(j) = false
  //     }
  //     isprime
  //   }
  //   // @return Array of primes that is less than or equal to n
  //   final def primes(n : Int) : Array[Int] =
  //     sieve(n).zipWithIndex.withFilter(_._1).map(_._2)
  // }
  object EnRich {
    implicit class AString(val self : String) extends AnyVal {
      def splitToIntArray = self.split(" ").map(_.toInt)
    }
    // implicit class PowerInt(val self : Int) extends AnyVal {
    //   def ** (n : Int) : Int = 
    // }
  }
}

import Lib.EnRich._
object Main {
  def solve(n : Long) : Int = {
    val fermat_numbers = List[Long](3, 5, 17, 257, 65537)
    def big(c : Set[Long],k : Long) : Set[Long] = {
      c.withFilter(_*k <= n).map(_*k) ++ c
    }
    val init = (0l to Math.ceil(Math.log(n)/Math.log(2)).toLong).
                 map((k) => Math.round(Math.pow(2,k)).toLong).toSet
    val drawables_in_n = fermat_numbers.foldLeft(init)(big(_,_)).filter((i) => 3 <= i && i <= n)
    println(drawables_in_n)
    drawables_in_n.size
    // println(drawables)
    // println(drawables)
    // drawables.foreach(println(_))
    // (1 to n).filter(drawables.contains(_)).foreach(println(_))
    // (3 to n).count(drawables.contains(_))
  }
  def main(args : Array[String]) : Unit = {
    val n = readLine().toLong
    println(solve(n))
  }
}