AI slop

You are given a string $S$ of length $N$ consisting of lowercase English letters. In this problem, $S$ is called AI slop if it contains $\texttt{ai}$ as a substring.

A substring is a string obtained by taking consecutive characters from a string in their original order. For example, $\texttt{c}$, $\texttt{ca}$, $\texttt{at}$, and $\texttt{cat}$ are substrings of $\texttt{cat}$. The string $\texttt{ct}$ is not a substring because its two characters are not consecutive.

Determine whether $S$ is AI slop.

The input is given in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$ $\vdots$ $\mathrm{case}_T$

Each case is given in the following format:

$N$ $S$

$T$ is the number of test cases. For each case, the first line contains the string length $N$, and the second line contains the string $S$.

For each test case, print AI slop on one line if $S$ contains $\texttt{ai}$ as a substring. Otherwise, print Human made.

Use the exact capitalization shown, with one space between the two words.

• $1 \leq T \leq 100\,000$.
• $1 \leq N \leq 500\,000$.
• $|S|=N$.
• $S$ consists only of lowercase English letters.
• The sum of $N$ over all test cases is at most $500\,000$.