#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

int main() {
    string S;

    rep(i, 6) rep(j, 6) rep(k, 6) rep(l, 6) rep(m, 6) {
        int x = ((10 + i) << 16) + ((10 + j) << 12) + ((10 + k) << 8) + ((10 + l) << 4) + ((10 + m) << 0);
        vector<int> v(8, 0);
        while (x > 0) {
            v[x % 8]++;
            x /= 8;
        }
        bool flag = empty(S);
        rep2(i, 1, 7) {
            if (v[i] != 1) flag = false;
        }
        if (flag) {
            S += char('A' + i);
            S += char('A' + j);
            S += char('A' + k);
            S += char('A' + l);
            S += char('A' + m);
        }
    }

    // cout << S << '\n';

    int T;
    cin >> T;

    while (T--) {
        int N;
        cin >> N;

        int K = N / 28;
        string ans;
        rep(i, K) ans += "ACCACCCCCCCCABACAAFFE";

        if (N % 28 == 5) {
            ans += S;
        } else if (N % 28 == 10) {
            ans += "BBCCCFACAC";
        } else if (N % 28 == 21) {
            ans += "ACCACCCCCCCCABACAAFFE";
        } else if (N % 28 != 0) {
            ans = "-1";
        }

        cout << ans << '\n';
    }
}