#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,ans,xxz[114];
bool dfs(int x,int step){
	if(step>ans||x<=0)return 0;
	if(x==n)return 1;
	if(x*pow(2,ans-step)<n||x/pow(2,ans-step)>n)return 0;
	else if(x*pow(2,ans-step)==n)return 1;
	xxz[step]=x;
	for(int i=0;i<=step;i++){
		if(dfs(x+xxz[i],step+1)||dfs(x-xxz[i],step+1)){
			return 1;
		}
	}
	return 0;
}
signed main(){
	freopen("pow_cal.in","r",stdin);freopen("pow_cal.out","w",stdout);
	while(cin>>n){
		if(!n)break;
		ans=0;
		if(n==1)printf("0\n");
		else
		{
			while(!dfs(1,0)){
				ans++;
			}
			printf("%lld\n",ans);
		}
	}
	return 0;
}