import java.util.*; public class Exercises16{ public static void main (String[] args){ Scanner sc = new Scanner(System.in); int goal = sc.nextInt(); LinkedList queue = new LinkedList(); ArrayList beforeQueue = new ArrayList(); ArrayList closed = new ArrayList(); closed.add(0); queue.offer(new Block(1, 1)); while(queue.size() > 0){ Block currentBlock; currentBlock = queue.poll(); System.out.println(currentBlock.value); if (currentBlock.value == goal){ System.out.println(currentBlock.count); break; } Block forward = currentBlock.getForwardNum(); Block back = currentBlock.getBackNum(); if (beforeQueue.indexOf(forward.value) == -1 && forward.value < goal){ queue.offer(forward); beforeQueue.add(forward.value); } if (closed.indexOf(back.value) == -1){ queue.offer(back); closed.add(back.value); } } if (queue.size() == 0){ System.out.println(-1); } } } class Block { public int value; private int num; public int count; private int bitcount; Block (int newValue, int currentCount){ value = newValue; num = newValue; count = currentCount; bitcount = 0; } public Block getForwardNum(){ while (num != 0){ if (num % 2 == 1){ bitcount += 1; } num /= 2; } return new Block (value + bitcount, count + 1); } public Block getBackNum(){ while (num != 0){ if (num % 2 == 1){ bitcount += 1; } num /= 2; } return new Block (value - bitcount, count + 1); } }