(use data.queue)
(define n (string->number (read-line)))
(define v (make-vector n 0))
(define q (make-queue))

(define (count-bit n)
  (letrec*
    ((i 0)
     (count (lambda (n c)
                   (if (zero? n) 
                       c  
                       (begin
                         (inc! c)
                         (count (logand n (- n 1)) c))))))
    (count n i)))

(define (check)
  (call/cc 
   (lambda (return)
     (begin
       (if (queue-empty? q) (return -1)
        (let* 
          ((now (dequeue! q))
           (bit (count-bit now))
           (prev (- now bit))
           (next (+ now bit))
           (c (vector-ref v (- now 1))))
          (begin
           (when (eq? now n) (return c))
           (begin
             (unless
               (or 
                 (< prev 1)
                 (positive? (vector-ref v (- prev 1))))
               (begin
                 (vector-set! v (- prev 1) (+ c 1))
                 (enqueue-unique! q eq? prev)))
             (unless
               (or
                 (> next n)
                 (positive? (vector-ref v (- next 1))))
               (if (eq? n next)
                 (return (+ c 1))
                (begin
                    (vector-set! v (- next 1) (+ c 1))
                    (enqueue-unique! q eq? next)))))
           (check))))))))

(begin
 (enqueue! q 1)
 (vector-set! v 0 1)
 (print (check)))