// Arup Guha
// 3/11/2019
// Solution to 2019 UCF HS Problem: Hating on Fractions

import java.util.*;

public class fractions {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();
		
		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {
			
			// Read in the numbers.
			int n = stdin.nextInt();
			int[] list = new int[n];
			for (int i=0; i<n; i++)
				list[i] = stdin.nextInt();
			
			// Sort so we just check adjacent pairs.
			Arrays.sort(list);
			
			// Check if each adjacent pair are multiples or not.
			boolean ok = true;
			for (int i=0; i<n-1; i++)
				if (list[i+1]%list[i] != 0)
					ok = false;
				
			// Output accordingly.
			if (!ok)
				System.out.println("Array #"+loop+": Go away!");
			else
				System.out.println("Array #"+loop+": This array is bae!");
		}
	}
}