/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define	endl		'\n'
#define mii         map<ll,ll>
#define msi         map<string,ll>
#define mis         map<ll, string>
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repr(i,a,b) for(ll i=b-1;i>=a;i--)
#define trav(a, x) 	for(auto& a : x)
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pair<ll, ll>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define max(a,b)	(a>b?a:b)
#define min(a,b)	(a<b?a:b)

/*	For Debugging	*/
#define DEBUG 		cerr<<"/n>>>I'm Here<<</n"<<endl;
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl;
#define what_is(x)  cerr << #x << " is " << x << endl;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
#define DECIMAL(n)  cout << fixed ; cout << setprecision(n);
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N  5000005
ll dp[N];
ll ans[N];
ll fun(ll n)
{
	if(n<N && dp[n]!=-1)
		return dp[n];
	if(n<N)
	{
		dp[n]=(n&1?fun(3*n+1)+1:fun(n/2)+1);
		return dp[n];
	}
	else
	{
		return (n&1?fun(3*n+1)+1:fun(n/2)+1);
	}
}
void solve()
{
	ll n;
	cin>>n;
	cout<<ans[n]<<endl;
	return;
}
int main()
{
	FAST
	rep(i,1,N)
	dp[i]=-1;

	dp[0]=0;
	dp[1]=0;
	// dp[2]=1;
	rep(i,2,N)
	{
		fun(i);
	}

	// cout<<dp[18]<<" "<<dp[19]<<endl;

	ans[1]=1;
	rep(i,2,N)
	{
		if(dp[i]>=dp[ans[i-1]])
			ans[i]=i;
		else
			ans[i]=ans[i-1];
	}

	int TESTS=1;
	cin>>TESTS;
	while(TESTS--)
	{
		solve();
	}
	TIME
	return 0;
}