#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <utility>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define LL long long
#define INF 1000000001
#define mod 1000000007
using namespace std;
int keta(int n,int k){return (n/int(pow(10,double(k-1)))) % 10;} //nの下からk桁目
ll gcd(ll n,ll m){
	if(n<m){ll a=m;m=n;n=a;}
	ll r=n%m;
	while(r!=0){
		n=m;
		m=r;
		r=n%m;
	}
	return m;
}
ll lcm(ll n,ll m){
	return n*m/gcd(n,m);
}

int main(){
	
	int n;
	cin>>n;
	if(n==1){
		cout<<1<<endl;
		return 0;
	}
	int *a,*b;
	a=new int[n-1];
	b=new int[n];
	rep(i,n){
		b[i]=INF;
	}
	a[0]=1;
	int j=1;
	FOR(i,j,2*j+1){
		if(i==n-1)break;
		if(i==j)a[i]=1;
		else{
			a[i]=a[i-j-1]+1;
		}
		if(i==2*j){
			j=2*j+1;
			continue;
		}
	}
	/*rep(i,n-1){
		cout<<a[i]<<endl;
	}*/

	queue<int> que;

	que.push(0);
	b[0]=1;
	int q;
	while(que.size()){
		q=que.front();
		que.pop();
		if(q==n-1){
			cout<<b[q]<<endl;
			return 0;
		}
		if(q-a[q]>=0){
			if(b[q-a[q]]==INF){
				b[q-a[q]]=b[q]+1;
				que.push(q-a[q]);
			}
		}
		if(q+a[q]<n){
			if(b[q+a[q]]==INF){
				b[q+a[q]]=b[q]+1;
				que.push(q+a[q]);
			}
		}
	}
	cout<<-1<<endl;

	delete []a,b;
}