highest composite number 85%

const N = parseInt(readline());

let nbDivisors = (e) => {
    let r = 0
    for(let i = 1; i <= e; i++)
        if(e%i == 0)
            r++
    return r
}
let isHCM = (f) => {
    let max = nbDivisors(f)
    for(let i = 1; i < f; i++)
        if(nbDivisors(i) > max)
            return false
    return true
}
for(let i = N; i >= 1; i--)
{
    if(isHCM(i))
    {
        print(i,nbDivisors(i))
        return
    }
}