#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}

fn dfs(x: i64, rem: usize) -> Result<(), i64> {
    if rem == 0 {
        let mut f = [0; 8];
        let mut v = x;
        while v > 0 {
            f[(v % 8) as usize] += 1;
            v /= 8;
        }
        let ok = (1..8).all(|i| f[i] == f[1]);
        if ok {
            eprintln!("{:x}", x);
            return Err(x);
        }
        return Ok(());
    }
    for i in 0xa..0x10 {
        dfs(16 * x + i, rem - 1)?;
    }
    Ok(())
}

fn ex(n: usize) {
    let ans = dfs(0, n);
    if let Err(x) = ans {
        eprintln!("n = {}: {:x}", n, x);
        let mut v = x;
        let mut o = vec![];
        while v > 0 {
            o.push(v % 8);
            v /= 8;
        }
        o.reverse();
        eprintln!("{:?}", o);
    }
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}
    input! {
        t: usize,
        n: [usize; t],
    }
    let s = "ACCACCCCCCCCABACAAFFE";
    for n in n {
        if n % 21 == 5 {
            puts!("ABDCC");
            for _ in 0..n / 21 {
                puts!("{}", s);
            }
            puts!("\n");
            continue;
        }
        if n % 21 == 10 {
            puts!("AAABCCCDFC");
            for _ in 0..n / 21 {
                puts!("{}", s);
            }
            puts!("\n");
            continue;
        }
        if n % 21 == 0 {
            for _ in 0..n / 21 {
                puts!("{}", s);
            }
            puts!("\n");
            continue;
        }
        puts!("-1\n");
    }
}