import java.security.KeyStore.TrustedCertificateEntry
import java.util
import java.util.regex.Pattern
import java.util.{ArrayList, Collections, Comparator, List => JList}

import scala.collection.immutable.TreeMap
import scala.math._
import scala.collection.mutable
import scala.collection.mutable.{ArrayBuffer, ListBuffer}
import scala.util.{Failure, Success, Try}

object Main{
  val LINE_SEPARATOR = "\n"
  def main(args: Array[String]): Unit = {
    if (sys.env.getOrElse("TEST", "")=="1"){
      println(test());
    }else{
      val input=io.Source.stdin.getLines().mkString(LINE_SEPARATOR);
      println(solve(input).trim());
    }
  }

  def init (nRows: Int, nCols: Int, default: Int) = Array.tabulate(nRows,nCols)( (x,y) =>  default)

  def sortIgnoreCase1(list: JList[String]): JList[String] = {
    val r = new ArrayList[String](list)
    Collections.sort(r, new Comparator[String] {
      override def compare(o1: String, o2: String): Int = o1.compareToIgnoreCase(o2)
    })
    r
  }

//  def solve(input: String): String = {
//    val Array(n, q) = input.split(LINE_SEPARATOR).head.split(" ").map(_.toInt)
//    val a = input.split(LINE_SEPARATOR).tail.take(n).map(_.split(" ").head.toInt)
//    val b = input.split(LINE_SEPARATOR).tail.take(n).map(_.split(" ").tail.head.toInt)
//    val c = input.split(LINE_SEPARATOR).drop(n + 1).map(_.split(" ").head.toInt)
//    val d = input.split(LINE_SEPARATOR).drop(n + 1).map(_.split(" ").tail.head.toInt)
//    val k = 2 * pow(10, 5).toInt
//    val INF = pow(10, 9).toInt + 1
//    val pqList = (0 until k).map(_ => new mutable.TreeSet[Int]).toArray
//    val pqList2 = (0 until k).map(_ => (0 until k).map(_ => 0).toArray).toArray
//    val i2k = (0 until n).map{i =>
//      b(i)
//    }.toArray
//    (0 until n).foreach{i =>
//      pqList(b(i) - 1) += (a(i))
//    }
//    val maxList = pqList.map(pq => if (pq.nonEmpty) pq.last else INF)
//
//    (0 until q).map{j =>
//      pqList(d(j) - 1) += a(c(j) - 1)
//      pqList2(d(j) - 1)(a(c(j) - 1)) += 1
//      pqList2(i2k(c(j) - 1) - 1)(a(c(j) - 1)) -= 1
//      if (pqList2(i2k(c(j) - 1) - 1)(a(c(j) - 1)) == 0) pqList(i2k(c(j) - 1) - 1) -= a(c(j) - 1)
//
//      maxList(i2k(c(j) - 1) - 1) = pqList(i2k(c(j) - 1) - 1).last
//      i2k(c(j) - 1) = d(j)
//      maxList(d(j) - 1) = pqList(d(j) - 1).last
//      maxList.min
//    }.mkString(LINE_SEPARATOR)
//  }

  def solve(input: String): String = {
    val x = input.toLong
    (1 to 3760).scanLeft(100L){(x, k) =>
      (x * 1.01).toLong
    }.zipWithIndex.toList.find(_._1 >= x).get._2.toString
  }

  def medianCalculator(seq: Seq[Long]): Long = {
    //In order if you are not sure that 'seq' is sorted
    val sortedSeq = seq.sortWith(_ < _)

    if (seq.size % 2 == 1) sortedSeq(sortedSeq.size / 2)
    else {
      val (up, down) = sortedSeq.splitAt(seq.size / 2)
      (up.last + down.head) / 2
    }
  }

  def factorize(x: Long): List[Long] = {
    def foo(x: Long, a: Long = 2, list: List[Long] = Nil): List[Long] = a*a > x match {
      case false if x % a == 0 => foo(x / a, a    , a :: list)
      case false               => foo(x    , a + 1, list)
      case true                => x :: list
    }
    foo(x)
  }

  def divisors(n: Int): Vector[Int] = {
    val halfList = (1 to sqrt(n).toInt).toVector.filter(n % _ == 0).map(_.toInt)
    val reversedList = if (sqrt(n).floor == sqrt(n)) halfList.reverse.tail.map(n/_) else halfList.reverse.map(n/_)
    halfList ++ reversedList
  }

  def gcd(m: Long, n: Long): Long = n match {
    case 0 => m
    case _ => gcd(n, m % n)
  }
  def lcm(a: Long, b: Long): Long = a * b / gcd(a, b)

  val tests=List(
    """103""".stripMargin -> """3
                               |
                                   |
                                            |
                                          |
                               |
                                     |
                                   |
                                 |""".stripMargin
//    ,
//    """2 2
//      |4208 1234
//      |3056 5678
//      |1 2020
//      |2 2020""".stripMargin -> """3056
//                                      |4208""".stripMargin
  )

  def test():String= {
    return tests.map{case (i,o)=>(i.trim(),o.trim())}
      .zipWithIndex.map{
      case ((input,outputExpect),i)=>{
        val output=solve(input).trim();
        s"test${i+1}:"+(if(output==outputExpect){
          "Passed"
        }else{
          s"Failed\nexpect:\n${outputExpect}\noutput:\n${output}"
        })
      }}
      .mkString("\n");
  }



}


Measured memory_bytes: 55532