import bisect
import heapq
import itertools
import sys
import math
import random
import time
from collections import Counter, deque, defaultdict
from functools import reduce
from operator import xor
from typing import List

mod = 10 ** 9 + 7
sys.setrecursionlimit(10 ** 9)


def lmi():
    return list(map(int, input().split()))


def main():
    N = int(input())
    queue = deque()
    queue.append((1, 1))
    visited = set()
    while queue:
        cur, depth = queue.popleft()
        if cur < 0 or N + 1 <= cur:
            continue
        if cur in visited:
            continue
        if cur == N:
            print(depth)
            return

        visited.add(cur)
        queue.append((cur + f(cur), depth + 1))
        queue.append((cur - f(cur), depth + 1))
    
    print(-1)


def f(num):
    ret = 0
    while num:
        if num % 2 == 1:
            ret += 1
        num >>= 1
    return ret



if __name__ == '__main__':
    main()