import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] costs = new int[n + 1];
        Arrays.fill(costs, Integer.MAX_VALUE);
        PriorityQueue<Path> queue = new PriorityQueue<>();
        queue.add(new Path(1, 1));
        while (queue.size() > 0) {
            Path p = queue.poll();
            if (p.idx < 0 || p.idx > n || costs[p.idx] <= p.value) {
                continue;
            }
            costs[p.idx] = p.value;
            int count = getCount(p.idx);
            queue.add(new Path(p.idx + count, p.value + 1));
            queue.add(new Path(p.idx - count, p.value + 1));
        }
        if (costs[n] == Integer.MAX_VALUE) {
            System.out.println(-1);
        } else {
            System.out.println(costs[n]);
        }
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int value;
        
        public Path(int idx, int value) {
            this.idx = idx;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
    }
    
    static int getCount(int x) {
        int count = 0;
        while (x > 0) {
            count += x % 2;
            x /= 2;
        }
        return count;
    }
}