import Foundation

let n = Int(readLine()!)!
var distances = Array<Int>(repeating: 0, count: n)
let bits: Array<Int> = (0 ..< n).map { value in 
    var ret = 0
    var vv = value + 1
    while vv > 0 {
        if vv % 2 != 0 {
            ret += 1
        }
        vv /= 2
    }
    return ret
}

var queue = Array<Int>()
var visitedCount = 0
queue.append(0)
distances[0] = 1
while !queue.isEmpty {
    let current = queue.removeFirst()
    if current == n - 1 {
        print("\(distances[current])")
        exit(0)
    }
    visitedCount += 1
    if visitedCount == n {
        break
    }
    let bit = bits[current]
    if current >= bit {
        let next = current - bit
        if distances[next] == 0 {
            distances[next] = distances[current] + 1
            queue.append(next)
        }
    }
    if current < n - bit {
        let next = current + bit
        if distances[next] == 0 {
            distances[next] = distances[current] + 1
            queue.append(next)
        }
    }
}

print("-1")