from collections import deque

N = int(input())
num_dict = {}
def _d_to_one(digit):
    """
    return number of 1 in binary of digit
    """
    binary = "{0: b}".format(digit)
    num_one = 0
    for i in range(len(binary)):
        if binary[i] == "1":
            num_one += 1
    return num_one

def d_to_one(digit):
    try:
        num = num_dict[digit]
    except KeyError:
        num = _d_to_one(digit)
        num_dict[digit] = num
    return num
def next_num(digits):
    step = d_to_one(digits)
    next = []
    if digits - step > 1:
        next.append(digits - step)
        
    if digits + step <= N:
        next.append(digits + step)
    return next


def bfs(start):
    if start == N:
        return [start]
    queue = deque([(start, [start])])
    

    while queue:

        vertex, path = queue.popleft()
        for next in set(next_num(vertex)) - set(path):
            if next == N:
                path.append(next)
                return path
            else:
                queue.append((next, path + [next]))
    return None

def bfs_no_path(start):
    if start == N:
        return start

    count = 1
    visited = set([start])

    queue = deque([(start, count)])
    

    while queue:
        vertex, count= queue.popleft()
        for next in set(next_num(vertex)) - visited :
            if next == N:
                count  += 1
                return count 

            else:
                visited.add(next)
                queue.append((next,  count + 1))
    return None



def main():
    result = bfs_no_path(1)
    if result is not None:
        print(result)
    else:
        
        print(-1)
if __name__ == "__main__":
    main()