import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } string solve(int N) { string ans; switch (N % 21) { case 0: ans = ""; break; case 5: ans = "BDBCC"; break; case 10: ans = "BBCCCFACAC"; break; default: return "-1"; } ans ~= "ACCACCCCCCCCABACAAFFE".repeat(N / 21).join; return ans; } void main() { debug { foreach (cs; ["BBCCCFACACL", "ACCACCCCCCCCABACAAFFEL"]) { BigInt val; foreach (c; cs) { val = val * 16 + (10 + (c - 'A')); } char[] ds; for (; val > 0; val >>= 3) { ds ~= cast(char)('0' + cast(int)(val & 7)); } ds.reverse; writeln(cs); writeln(ds); } } debug { foreach (n; 1 .. 200 + 1) { writeln(n, ": ", solve(n)); } } try { for (; ; ) { const numCases = readInt(); foreach (_; 0 .. numCases) { const N = readInt(); const ans = solve(N); writeln(ans); } } } catch (EOFException e) { } }