fun main() {
    val n = readln().toLong()
    // region prime factorization
    var number = n
    var divisor = 2L
    val pf = mutableMapOf<Long, Int>()
    while (divisor * divisor <= number) {
        var count = 0
        while (number % divisor == 0L) {
            number /= divisor
            count++
        }
        if (count > 0) {
            pf[divisor] = count
        }
        divisor++
    }
    if (number > 1) pf[number] = 1
    // endregion
    println(if (pf.size <= 2) "Yes" else "No")
}