using System;
using System.Collections.Generic;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using System.Threading.Tasks;


namespace yuki0003 {
    internal static class Program {
        internal static int CountHighBits(int value) {
            return value == 0 ? 0 : ( value % 2 + CountHighBits( value >> 1 ) );
        }

        public static int Solve(System.IO.TextReader reader) {
            var n = int.Parse( reader.ReadLine() );
            var cost = new int[n];
            var stack = new Stack<int>();
            var answer = -1;
            const int FIRST = 1;
            stack.Push( FIRST );
            cost[ FIRST - 1 ] = 1;
            int cur, backward, forward;
            while (stack.Count>0) {
                cur = stack.Pop();
                if (cur == n) {
                    answer = cost[ cur - 1 ];
                    break;
                }
                backward = cur - CountHighBits( cur );
                if (backward >= 1 && cost[backward-1]==0) {
                    stack.Push( backward );
                    cost[ backward - 1 ] = cost[ cur - 1 ] + 1;
                }
                forward = cur + CountHighBits( cur );
                if (forward <= n && cost[ forward - 1 ] == 0) {
                    stack.Push( forward );
                    cost[ forward - 1 ] = cost[ cur - 1 ] + 1;
                }
            }
            return answer;
        }

        static void Main(string[] args) {
            Console.WriteLine( Solve( System.Console.In ) );
        }
    }
}