using LIB; using System; using System.Linq; using System.Text; using System.Collections.Generic; class Program { public static IO IO = new IO(); static void Main(string[] args) { int n = IO.INT(); BFSNUMBER Q = new BFSNUMBER(n + 1); int o = -1; Q.PUSH(1, 1); while (Q.SIZE() != 0) { PAIR b = Q.POP(); int bit = BIT(b.KEY); if (b.KEY == n) { o = b.VALUE; break; } Q.PUSH(b.KEY - bit, b.VALUE + 1); Q.PUSH(b.KEY + bit, b.VALUE + 1); } IO.WRITE(o); IO.FLUSH(); } public static int BIT(int n) { int ret = 0; for (int i = 0; i < 32; i++) { if ((1 << i & n) != 0) { ret++; } } return ret; } } #region BFS namespace LIB { public class BFSNUMBER : QUEUE> { private bool[] f; private int MIN; public BFSNUMBER(int max, int min = 0) : base(max) { MIN = min; f = new bool[max - min]; } public void PUSH(int key, T value) { PUSH(new PAIR(key, value)); } public override void PUSH(PAIR v) { int k = v.KEY - MIN; if (k >= 0 && k < m - MIN && !f[v.KEY]) { f[k] = true; base.PUSH(v); } } } } #endregion #region QUEUE namespace LIB { public class QUEUE { protected int m; private int s, e, c; private T[] q; public QUEUE(int max) { m = max; q = new T[m]; CLEAR(); } public void CLEAR() { e = 0; s = 0; c = 0; } public int SIZE() { return c; } public T TOP() { return q[0]; } public T POP() { T r = q[s++]; s %= m; c--; return r; } public virtual void PUSH(T v) { q[e++] = v; e %= m; c++; } public bool EMPTY() { return SIZE() == 0; } } } #endregion #region PAIR namespace LIB { public class PAIR : IEquatable> where T : IEquatable { public T KEY; public U VALUE; public PAIR(T key, U value) { KEY = key; VALUE = value; } public bool SAME(PAIR b) { return Equals(b); } public bool Equals(PAIR b) { return KEY.Equals(b.KEY); } } } #endregion namespace LIB { public class IO { private const int WMAX = 1000; private StringBuilder S = new StringBuilder(); private T R(Func f) { return f(Console.ReadLine()); } private T[] R(Func f, char c) { return STRING().Split(c).Select(f).ToArray(); } private T[] R(Func f, int l) { T[] r = new T[l]; for (int i = 0; i < l; i++) { r[i] = R(f); } return r; } private T[][] R(Func f, int l, char c) { T[][] r = new T[l][]; for (int i = 0; i < l; i++) { r[i] = R(f, c); } return r; } private void W(Func f, T v, bool lf = true) { S.Append(f(v)); if (lf) { S.Append('\n'); } if (S.Length >= WMAX) { FLUSH(); } } public string STRING() { return R(s => s); } public string[] STRING(char c) { return R(s => s, c); } public string[] STRING(int l) { return R(s => s, l); } public string[][] STRING(int l, char c) { return R(s => s, l, c); } public int INT() { return R(int.Parse); } public int[] INT(char c) { return R(int.Parse, c); } public int[] INT(int l) { return R(int.Parse, l); } public int[][] INT(int l, char c) { return R(int.Parse, l, c); } public long LONG() { return R(long.Parse); } public long[] LONG(char c) { return R(long.Parse, c); } public long[] LONG(int l) { return R(long.Parse, l); } public long[][] LONG(int l, char c) { return R(long.Parse, l, c); } public double DOUBLE() { return R(double.Parse); } public double[] DOUBLE(char c) { return R(double.Parse, c); } public double[] DOUBLE(int l) { return R(double.Parse, l); } public double[][] DOUBLE(int l, char c) { return R(double.Parse, l, c); } public void WRITE(object s, bool lf = true) { W(v => v.ToString(), s, lf); } public void FLUSH() { Console.Write(S); S.Length = 0; } } }