def bit_sugoroku(N):
    if N == 1:
        return 1
    steps = 1
    pos = 1
    frontier = [pos]
    visited = {pos}
    while frontier:
        new_frontier = []
        steps += 1
        for pos in frontier:
            d = bin(pos).count('1')
            if pos + d == N or pos - d == N:
                return steps
            p1 = pos + d
            p2 = pos - d
            if p1 < N and p1 not in visited:
                visited.add(p1)
                new_frontier.append(p1)
            if p2 > 1 and p2 not in visited:
                visited.add(p2)
                new_frontier.append(p2)
        frontier = new_frontier
    return - 1

if __name__ == '__main__':
    N = int(input())
    print(bit_sugoroku(N))