using System;
using System.Linq;
using System.Collections.Generic;

class Program
{    
    static void Main()
    {
        var n = ri();

        var cnt = new int[n + 1];
        for (int i = 0; i < n + 1; i++) cnt[i] = -1;
        cnt[1] = 1;

        var q = new Queue<int>();
        q.Enqueue(1);          

        while (q.Count > 0)
        {
            var p = q.Dequeue();
            if (p == n) break;
            int d = bitcount(p);
            if (p - d > 0)
                if (cnt[p - d] == -1 || (cnt[p - d] > cnt[p] + 1))
                {
                    q.Enqueue(p - d);
                    cnt[p - d] = cnt[p] + 1;
                }
            if (p + d <= n)
                if (cnt[p + d] == -1 || (cnt[p + d] > cnt[p] + 1))
                {
                    q.Enqueue(p + d);
                    cnt[p + d] = cnt[p] + 1;
                }            
        }

        Console.WriteLine(cnt[n]);
    }

    static int bitcount(int n)
    {
        int c = 0;
        while (n > 0)
        {
            c++;
            n &= n - 1;
        }
        return c;
    }
    #region Scan
    static int ri() { return int.Parse(Console.ReadLine().Trim()); }
    static long rl() { return long.Parse(Console.ReadLine().Trim()); }
    static double rd() { return double.Parse(Console.ReadLine().Trim()); }
    static string rs() { return Console.ReadLine().Trim(); }
    static int[] ria() { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); }
    static long[] rla() { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); }
    static double[] rda() { return Console.ReadLine().Trim().Split().Select(double.Parse).ToArray(); }
    static string[] rsa() { return Console.ReadLine().Trim().Split(); }
    static void mul(out int a, out int b) { var arr = ria(); a = arr[0]; b = arr[1]; }
    static void mul(out int a, out int b, out int c) { var arr = ria(); a = arr[0]; b = arr[1]; c = arr[2]; }
    static void mul(out int a, out int b, out int c, out int d) { var arr = ria(); a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
    static void mul(out long a, out long b) { var arr = rla(); a = arr[0]; b = arr[1]; }
    static void mul(out long a, out long b, out long c) { var arr = rla(); a = arr[0]; b = arr[1]; c = arr[2]; }
    static void mul(out long a, out long b, out long c, out long d) { var arr = rla(); a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
    #endregion
    #region Math
    const int mod = 1000000007;
    static bool isprime(long n){ if (n < 2) return false; for (long i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; }
    static long gcd(long a, long b) { return a == 0 ? b : gcd(b % a, a); }
    static long lcm(long a, long b) { return a * b / gcd(a, b); }
    #endregion
}