#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
vector<long long int> v;
vector<long long int> w, ab, bc;
set<long long int> uo;
map<long long int, long long int> ww, cc, u;
vector<pair<long long int, long long int> > uu;
map<long long int, vector<long long int> > uuu;
map<pair<long long int, long long int>, long long int> vo;
map<pair<long long int, long long int>, long long int> vu;
long long int br[10005];
long long int dxx[] = {-1, 0, 1, 0};
long long int dyy[] = {0, 1, 0, -1};
long long int dx[] = {2, 1, -1, -2, -2, -1, 1, 2};
long long int dy[] = {1, 2, 2, 1, -1, -2, -2, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  char ch;
  string a, b, c;
  double x, y, d, e, f, g, h;
  long long int n, m, i, j, k, p, q, o, l, s, tt = 1, t, z, aa, r = 0;
  for (i = 1, l = 0; i <= 100000000000000000; i *= 6, l++) {
    v.push_back(i);
  }
  cin >> tt;
  while (tt--) {
    cin >> n;
    for (i = 0, k = 4e18; i < v.size(); i++) {
      if (v[i] >= n) {
        s = v[i];
        t = 0;
        while (1) {
          if (s > n && s % 2 == 0) {
            t++;
            s /= 2;
          } else {
            break;
          }
        }
        if (s == n) {
          k = min(i + t, k);
        }
      }
    }
    if (k == 4e18) {
      cout << -1 << "\n";
    } else {
      cout << k << "\n";
    }
  }
  return 0;
}
