import sys
import itertools
import collections

def popcount(i):
    c = 0
    while i > 0:
        i, m = divmod(i, 2)
        if m:
            c += 1

    return c


def resolve(in_):
    N = int(next(in_))
    INF = 10 ** 9
    costs = [INF] * (N + 1)
    costs[1] = 1
    used = [False] * (N + 1)
    q = collections.deque()
    q.append((1, 1))

    while q:
        pos, cost = q.pop()
        if used[pos]:
            continue
        used[pos] = True
        p = popcount(pos)
        f = pos + p
        if f <= N:
            costs[f] = min(costs[f], cost + 1)
            q.appendleft((f, cost + 1))
        b = pos - p
        if b > 0:
            costs[b] = min(costs[b], cost + 1)
            q.appendleft((b, cost + 1))
    
    return costs[N] if costs[N] != INF else -1


def main():
    ans = resolve(sys.stdin.buffer)
    print(ans)


if __name__ == '__main__':
    main()