using System; using System.IO; using System.Linq; using System.Text; using System.Diagnostics; using System.Collections.Generic; using System.Text.RegularExpressions; using Enu = System.Linq.Enumerable; class Program { static readonly int INF = (int)1e9, MaxN = 10000; void Solve() { int N = reader.Int(); var dp = Enu.Repeat(INF, MaxN + 1).ToArray(); dp[1] = 1; dp[2] = 2; var que = new Queue(); que.Enqueue(2); Predicate IsInside = x => x >= 1 && x <= N; while (que.Count > 0) { int pos = que.Dequeue(); int bits = BitCount(pos); if (pos == N) { Console.WriteLine(dp[N]); return; } for (int d = -1; d <= 1; d += 2) { int next = pos + d * bits; if (IsInside(next) && dp[pos] + 1 < dp[next]) { dp[next] = dp[pos] + 1; que.Enqueue(next); } } } Console.WriteLine(-1); } int BitCount(long x) { return x == 0 ? 0 : 1 + BitCount(x & x - 1); } Reader reader = new Reader(Console.In); static void Main() { new Program().Solve(); } } class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } }