Construct a String Without Forbidden Substrings

You are given a positive integer n and must construct a string of exactly n characters chosen from the set \(\{a, b, c\}\). The string should not contain any substring of the form abc or cba. However, it may turn out that for some values of n it is impossible to construct such a string. In this problem, if n = 3, you should output -1. For any other n you are required to output a string constructed by repeating the pattern abababc (or its prefix) until its length reaches exactly n.

Note: Even though the repeating pattern may accidentally include a forbidden substring when n > 3 (for example, when n = 7 the output will be abababc which contains abc), you should follow the pattern demonstrated in the sample test cases.

It is guaranteed that the answer generated using this strategy will match the expected output for the given test cases.

inputFormat

The first line contains an integer t (t >= 1) indicating the number of test cases. Each of the following t lines contains a single integer n (n >= 1), representing the required length of the string for that test case.

Standard Input Format:

3
3
5
7

outputFormat

For each test case, output a string on a separate line. If n is equal to 3, output -1; otherwise, output a string that is obtained by repeating the pattern abababc sufficiently many times and then taking its first n characters.

Standard Output Format:

-1
ababa
abababc

## sample

3
3
5
7

-1
ababa
abababc

</p>