#!/usr/bin/env python3
#fileencoding: utf-8

def popcnt(i):
    count = 0
    while i > 0:
        count += (i&0x1)
        i >>= 1
    return count

def solver(mat, hist, N):
    if hist[-1] == 0:
        return len(hist)+1
    route = N
    for i in range(N-1):
        if mat[hist[-1]][i] == 0:
            continue
        if i not in hist:
            tmp = solver(mat, hist+[i], N)
            if route > tmp:
                route = tmp
    return route

def main():
    N = int(input().strip())
    if N == 1:
        return 1

    mat = [[0]*N for i in range(N)]
    for i in range(N):
        bits = popcnt(i+1)
        if (i - bits) >= 0:
            mat[i-bits][i] = 1
        if (i + bits) < N:
            mat[i+bits][i] = 1

    if sum(mat[N-1]) == 0: # ゴールできない
        return -1

    goal = mat[N-1]
    route = N
    for i in range(N-1):
        if goal[i] == 0:
            continue
        route_temp = solver(mat, [i], N)
        if route_temp < route:
            route = route_temp
    if route == N:
        route = -1
    return route

print(main())