def main
    
    n = STDIN.readline.chomp.to_i
    table_forward, table_back = init_table(n)
    count = sugoroku(n, n, 1, table_forward, table_back)
    puts count < n ? count : -1

end

def init_table(n)

    table_forward = []
    table_back = []

    1.upto(n) do |i|

        table_forward[i] = i + bitcount(i)
        table_back[i] = i - bitcount(i)

    end

    [table_forward, table_back]

end

def sugoroku(n, goal, count, table_forward, table_back)

    ret = n

    if count >= n
        return ret
    elsif goal == 1
        return count
    end

    1.upto(goal - 1) do |i|
        if table_forward[i] == goal
            ret_tmp = sugoroku(n, i, count + 1, table_forward, table_back)
            ret = ret_tmp if ret_tmp < ret
        end
    end

    n.downto(goal + 1) do |i|
        if table_back[i] == goal
            ret_tmp = sugoroku(n, i, count + 1, table_forward, table_back)
            ret = ret_tmp if ret_tmp < ret
        end
    end

    ret

end

def bitcount(n)

    count = 0
    n.bit_length.times {|i| count += 1 if n[i] == 1}
    count

end

main()