// ---------- begin next_permutation ----------
fn next_permutation<T: Ord>(a: &mut [T]) -> bool {
    a.windows(2).rposition(|a| a[0] < a[1]).map_or(false, |x| {
        let y = a.iter().rposition(|b| a[x] < *b).unwrap();
        a.swap(x, y);
        a[(x + 1)..].reverse();
        true
    })
}
// ---------- end next_permutation ----------
// ---------- begin radix conversion(naive) ----------
// P 進表記の A を Q 進表記にする
// A = a_0 + a_1 * p + a_2 * p^2 + ...
// という形のものしか受け付けない
// 注意
// 0を与えた時の挙動
// p, q の大きさ
// q * p + p > 2^64 とかになったりしないか
fn radix_conversion(a: &[u64], p: u64, q: u64) -> Vec<u64> {
    assert!(p > 1 && q > 1);
    let mut b = vec![];
    for a in a.iter().rev() {
        let mut carry = *a;
        for b in b.iter_mut() {
            let v = *b * p + carry;
            *b = v % q;
            carry = v / q;
        }
        while carry > 0 {
            b.push(carry % q);
            carry /= q;
        }
    }
    if b.is_empty() {
        b.push(0);
    }
    b
}
// ---------- end radix conversion(naive) ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

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

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

// N = 5
// CAFAC

fn run() {
    input! {
        t: usize,
        n: [usize; t],
    }
    for n in n {
        let q = n / 21;
        let rem = n % 21;
        let mut ans = String::from("-1");
        if rem == 0 || rem == 5 || rem == 10 {
            ans.clear();
            if rem == 5 {
                ans.push_str("CAFAC");
            } else if rem == 10 {
                ans.push_str("BBCCCFACAC");
            }
            for _ in 0..q {
                ans.push_str("ACCACCCCCCCCABACAAFFE");
            }
        }
        println!("{}", ans);
    }
}

fn test() {
    let mut s = (1..=7).cycle().take(3 * 7).collect::<Vec<_>>();
    s.sort();
    while {
        let mut v = s.iter().fold(0u64, |s, a| s * 8 + *a);
        let mut p = vec![];
        while v > 0 {
            p.push(v % 16);
            v /= 16;
        }
        if p.iter().all(|v| *v >= 10) {
            let s = p.iter().map(|v| (*v - 10) as u8 + b'A').collect::<Vec<_>>();
            let mut a = vec![];
            for s in s.iter().rev() {
                let d = (*s - b'A') as u64 + 10;
                a.push(d);
            }
            let b = radix_conversion(&a, 16, 8);
            let mut cnt = [0; 8];
            for b in b.iter() {
                cnt[*b as usize] += 1;
            }
            let max = *cnt.iter().max().unwrap();
            if cnt[0] == 0 && cnt[1..].iter().all(|c| *c == max) {
                println!("{:?}", cnt);
                println!("{}", s.iter().map(|s| *s as char).collect::<String>());
            }
        }
        next_permutation(&mut s)
    } {}
}

fn main() {
    run();
}