n = gets.chomp.to_i
max = 0xffffffff
mins = [max]*(n+1)
mins[1] = 1
q = [[1, 1]]
until q.empty?
  i, c = q.shift

  m = i.to_s(2).count('1')

  if i - m > 0 && c + 1 < mins[i - m]
    q.push([i - m, c + 1])
    mins[i - m] = c + 1
  end

  if i + m <= n && c + 1 < mins[i + m]
    q.push([i + m, c + 1])
    mins[i + m] = c + 1
  end
end
puts mins[n] >= max ? -1 : mins[n]