def sugoroku(n):
    visited = set([1])
    cnt = 1
    que = [1]
    while len(que) > 0:
        if n in visited:
            return cnt
        new_que = []
        for now in que:
            b = bin(now).count('1')
            flont = now + b
            back = now - b
            if 0 < flont <= n and flont not in visited:
                new_que.append(flont)
                visited.add(flont)
            if 0 < back <= n and back not in visited:
                new_que.append(back)
                visited.add(back)
        cnt += 1
        que = new_que
    return -1

if __name__ == "__main__":
    n = int(input())
    print(sugoroku(n))