@@ -0,0 +1,591 @@
+import sys%0A%0A# Take input%0Aif len(sys.argv) %3E 1:%0A    N  = int(sys.argv%5B1%5D)%0Aelse:%0A    N = int(input(%22N? %22))%0A%0A%0Acurrent = N  # Repeat until we get to 1%0Awhile current != 1:%0A    # Decide what move we take%0A    if current %25 3 == 0:%0A        move = 0          # 0 if it's already divisible%0A    elif current %25 3 == 1:%0A        move = -1         # -1 if it's 1 too high%0A    else:%0A        move = 1          # 1 otherwise%0A%0A    # Print this step%0A    print(current, move)%0A%0A    # Play the game and generate the next current value%0A    current = (current + move) // 3%0A%0A# Print the last 1%0Aprint(current)%0A%0A# Done!%0A

add easy solution