DSA02041.cpp

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <numeric>
#include <unordered_set>
using namespace std;

#define ll long long
// MAX (long long) 1000000000000000000
//#define M 100 + 5
#define N 200

#define MOD (ll) 1000000007
#define ld long double
#define sz size()
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define faster() ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define zero(n) setw(n) << setfill('0')
#define stp(n) fixed << setprecision(n)

int main() {
	int t;
	cin >> t;

	while (t--) {
		int n;
		cin >> n;

		int res = 0;

		queue<pair<int, int>> q;
		q.push({ n , 0 });

		while (!q.empty()) {
			auto t = q.front();
			q.pop();

			if (t.first == 1) {
				res = t.second;
				break;
			}
			else
				if (t.first > 1) {
					if (t.first % 2 == 0) q.push({ t.first / 2 , t.second + 1 });
					if (t.first % 3 == 0) q.push({ t.first / 3, t.second + 1 });
					q.push({ t.first - 1, t.second + 1 });
				}

		}

		cout << res << endl;
	}

	return 0;
}