//No.3 ビットすごろく

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No3 {
    
    static final Scanner sc = new Scanner(System.in);
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve() {
        int n = sc.nextInt();
        final int[] d = new int[n];
        fill(d,Integer.MAX_VALUE);
        d[0] = 1;
        TreeSet<Integer> que = new TreeSet<Integer>(new Comparator<Integer>(){
            public int compare(Integer a, Integer b) {
                if (d[a] != d[b]) return d[a] - d[b];
                return a - b;
            }
        });

        que.add(0);

        while (!que.isEmpty()) {
            int cur = que.pollFirst();
            int bit = Integer.bitCount(cur+1);
            if (cur - bit >= 0 && d[cur-bit] > d[cur] + 1) {
                d[cur-bit] = d[cur] + 1;
                que.remove(cur-bit);
                que.add(cur-bit);
            }
            if (cur + bit <n && d[cur + bit] > d[cur] + 1) {
                d[cur+bit] = d[cur] + 1;
                que.remove(cur+bit);
                que.add(cur+bit);
            }
        }

        out.println(d[n-1]==Integer.MAX_VALUE?"-1":d[n-1]);
    }

    public static void main(String[] args) {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        sc.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}
}