#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <bitset>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <cstdlib>
#include <unordered_map>
#include <random>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#define mp make_pair
#define lson tr[now].ls
#define rson tr[now].rs
#define pb push_back
#define debug() cout<<"qwq"<<endl
#define mem(i,a) memset(i,a,sizeof(i))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
#define i128 __int128
#define pii pair<int,int>
const db eps=1e-10;
const ll INF = 0x3f3f3f3f;
const int siev =1000000+5;
const int inf = 0x3f3f3f3f;
const int DMAX = 2000000 + 100;
const ll MOD = 32768;
const ll LMOD = 1000000007;
const int hmod = 202010923;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template<class T> inline void print(T x){
    if(x<0){
        putchar('-');
        x=-x;
    }
    int a[20];
    int cnt=0;
    do{
        a[++cnt]=x%10;
        x/=10;
    }while(x>0);
    for(int i=cnt;i>=1;i--){
        putchar(a[i]+'0');
    }
    putchar('\n');
    // puts("");
}
template<class T> inline void read(T &x){
    x=0;
    T f=1;
    char ch=getchar();
    while(ch<'0' || ch>'9'){
        if(ch=='-'){
            f=-1;
        }
        ch=getchar();
    }
    while(ch<='9' && ch>='0'){
        x=x*10+(ch-'0');
        ch=getchar();
    }
    x*=f;
}
vector<int> g[DMAX];
int q;
bool vst[DMAX];
int dis[DMAX];
void Dij(int S){
    for(int i=0;i<=1048576;i++){
        dis[i]=1e9;
        vst[i]=0;
    }
    dis[S]=0,vst[S]=1;
    priority_queue<pair<int,int> > q;
    q.push(mp(0,S));
    while(!q.empty()){
        int u=q.top().second;
        q.pop();
        vst[u]=0;
        for(auto v:g[u]){
            if(dis[v]>dis[u]+1){
                dis[v]=dis[u]+1;
                if(!vst[v]){
                    vst[v]=1;
                    q.push(mp(-dis[v],v));
                }
            }
        }
    }
}
int main(){
    read(q);
    for(int i=0;i<=1048576;i++){
        if(i!=0){
            g[i].pb(i-1);
        }
        if(i!=1048576){
            g[i].pb(i+1);
        }
        if(i*2<=1048576){
            g[i].pb(i*2);
        }
    }
    Dij(0);
    int x;
    while(q--){
        read(x);
        x=abs(x);
        cout<<dis[x]<<endl;
    }
    return 0;
}