import java.util.Scanner

import scala.annotation.tailrec
import scala.collection.mutable

object Main extends App {
  val sc = new Scanner(System.in)
  val N = sc.nextLong

  def merge[A](a: Stream[A], b: Stream[A])(implicit ev$1: A => Ordered[A]): Stream[A] =
    (a.headOption, b.headOption) match {
      case (Some(x), Some(y)) if x < y => x #:: merge(a.tail, b)
      case (Some(x), Some(y)) if x > y => y #:: merge(a, b.tail)
      case (Some(x), Some(_)) => x #:: merge(a.tail, b.tail)
      case (_, None) => a
      case _ => b
    }


  def joinL[A](xs: Stream[Stream[A]])(implicit ev$1: A => Ordered[A]): Stream[A] =
    xs.head.head #:: merge(xs.head.tail, joinL(xs.tail))

  def minus[A](a: Stream[A], b: Stream[A])(implicit ev$1: A => Ordered[A]): Stream[A] =
    (a.headOption, b.headOption) match {
      case (Some(x), Some(y)) if x < y => x #:: minus(a.tail, b)
      case (Some(x), Some(y)) if x > y => minus(a, b.tail)
      case (Some(_), Some(_)) => minus(a.tail, b.tail)
      case _ => a
    }

  val primes: Stream[Long] = 2L #:: minus(Stream.iterate(3L)(_+1L),
    joinL(primes.map{p => Stream.iterate(p*p)(_+p)}))

  val a = mutable.Set.empty[Long]
  @tailrec
  def f(n: Long = N, t: Int = 1): Int = {
    val b = a.map(i => i * i)
    val zs = (primes.takeWhile(_ <= n).filter(!a.contains(_)) ++ b).filter(n % _ == 0)
    if (zs.isEmpty) t - 1
    else {
      val z = zs.head
      a += z

      val x = n / z
      val y = primes.takeWhile(_ <= x).filter(!a.contains(_)) ++ b :+ (z * z)
      if (y.exists(x % _ == 0)) f(x, t + 1)
      else t
    }
  }
  println(f())
}
