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

class No3
{
    static void Main()
    {
        var N = Int32.Parse(Console.ReadLine());
        var array = new int[N];
        for (int i = 0; i < N; ++i) array[i] = -1;
        array[0] = 1;
        var list = new Queue<int>();
        list.Enqueue(0);

        while (list.Count>0)
        {
            var u = list.Dequeue();
           
            var b = GetBit(u+1);
            if ((u + b) < N && array[u + b] == -1)
            {
                list.Enqueue(u + b);
                array[u + b] = array[u] + 1;
            }
            if (-1 < (u - b) && array[u - b] == -1)
            {
                list.Enqueue(u - b);
                array[u - b] = array[u] + 1;
            }
        }
        Console.WriteLine(array[N - 1]);
    }

    //二進数に直す
    static int GetBit(int num)
    {
        var list = new List<int>();
        while (num != 0 && num != 1)
        {
            if (num % 2 == 1) list.Add(1);
            else list.Add(0);
            num /= 2;
        }
        list.Add(num);
        return list.Sum();
    }
}