//不会 
#include<bits/stdc++.h>
using namespace std;
int n;
int x[2048];
int sum=1,ans,i;
void dfs(int c,int li){
    if(sum==n){
        ans=min(ans,c);
        return;
    }
    if(sum<0){
        return;
    }
    if(c>li){
        return;
    }
    cout<<'*';
    x[0]=1;
    x[1]=-1; 
    while(x[i]){
        x[0]=1;
        x[1]=-1;
        sum+=x[i];
        x[i+2]=sum;
        dfs(c+1,li);
        i++;
        x[i+2]=0;
    }
    return;
}
int main(){
    freopen("pow_cal.in","r",stdin);
    freopen("pow_cal.out","w",stdout);
    cin>>n;
    ans=n;
    dfs(0,ceil(log(n)/log(2)*1.0));
    cout<<ans;
    return 0;
}