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

namespace CompetitiveProgramming
{
    public class Program
    {
        public static void Main(string[] args)
        {
            var n = int.Parse(Console.ReadLine());
            var list = new int[n];
            for (int i = 0; i < list.Length; i++)
            {
                list[i] = Convert.ToString(i + 1, 2).Where(s => s == '1').Count();
            }

            var q = new Queue<int>();
            q.Enqueue(0);
            var history = new HashSet<int>();
            var count = 1;

            if (n == 1)
            {
                Console.WriteLine(1);
                return;
            }

            while (true)
            {
                var tmp_q = new Queue<int>();
                count++;

                while (q.Count > 0)
                {
                    var cur = q.Dequeue();
                    var move1 = cur + list[cur];
                    var move2 = cur - list[cur];

                    if(move1==list.Length-1)
                    {
                        Console.WriteLine(count);
                        return;
                    }

                    if (move1 < list.Length)
                    {
                        if (!history.Contains(move1))
                        {
                            tmp_q.Enqueue(move1);
                            history.Add(move1);
                        }
                    }
                    if (0 <= move2)
                    {
                        if (!history.Contains(move2))
                        {
                            tmp_q.Enqueue(move2);
                            history.Add(move2);
                        }
                    }
                }
                q.Clear();
                q = tmp_q;

                if (count >= list.Length)
                {
                    Console.WriteLine(-1);
                    break;
                }
            }
        }
    }
}