(define divisors2
  (lambda (n i res)
    (if (> (* i i) n)
      res
      (if (= (remainder n i) 0)
        (divisors2 n (+ i 1) (cons (cons i (quotient n i)) res))
        (divisors2 n (+ i 1) res)))))

(define divisors3
  (lambda (n i res)
    (if (> (* i i i) n)
      res
      (if (= (remainder n i) 0)
        (divisors3 n (+ i 1) (append res (map (lambda (x) (cons i x)) (divisors2 (quotient n i) 1 '()))))
        (divisors3 n (+ i 1) res)))))

(define foldl
  (lambda (f e L)
    (if (null? L) e
      (foldl f (f e (car L)) (cdr L)))))

(define min-element
  (lambda (L)
    (foldl min (car L) L)))

(define evaluate
  (lambda (pqr)
    (let ((p (car pqr)) (q (cadr pqr)) (r (cddr pqr)))
      (+ (- p 1) (- q 1) (- r 1)))))

(define solve-min
  (lambda (N)
    (min-element (map evaluate (divisors3 N 1 '())))))

(define solve-max
  (lambda (N)
    (- N 1)))

(define N (read))

(display (solve-min N))
(display " ")
(display (solve-max N))
(newline)