#include <iostream>
#include <bitset>
#include <queue>

int main(int argc, const char * argv[]) {
    // insert code here...
    int n = 4;
//    std::cin >> n ;
    std::queue<int> q;
    std::vector<int> directions(n+1);
    q.push(1);
    directions[1]=1;
    int state=1;
    
    while (state != n) {
        int bit = std::bitset<8>(state).count();
        int v1 = state +bit, v2 = state -bit;
        if (v1 <= n && directions[v1] == 0) {
            q.push(v1);
            directions[v1] = directions[state] + 1;
        }
        if (v2 > 0 && directions[v2] == 0) {
            q.push(v2);
            directions[v2] = directions[state] + 1;
        }
        if (q.size() == 0) {
            std::cout << -1 << std::endl;
            return 0;
        }

        state = q.front();
        q.pop();
    }
    std::cout  << directions[state] << std::endl;
    return 0;
}