{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"The greatest common divisor (GCD) of two or more numbers is the greatest common factor number that divides them, exactly. It is also called the highest common factor (HCF). For example, the greatest common factor of 15 and 10 is 5, since both the numbers can be divided by 5.\n\u003cbr\u003e\u003cbr\u003e\nGiven the N integers, you have to find the maximum GCD (greatest common divisor) of every possible pair of these integers."}},{"title":"Input","value":{"format":"HTML","content":"The first line of input is an integer N (1 \u003c N \u003c 100) that determines the number of test cases. The following N lines are the N test cases. Each test case contains M (1 \u003c M \u003c 100) positive integers that you have to find the maximum of GCD."}},{"title":"Output","value":{"format":"HTML","content":"For each test case show the maximum GCD of every possible pair."}},{"title":"Sample Input","value":{"format":"HTML","content":"4 \u003cbr\u003e\n3\u0026nbsp;50\u0026nbsp;23\u0026nbsp;60\u0026nbsp;22\u0026nbsp;99\u0026nbsp;45\u0026nbsp;88\u003cbr\u003e\n10\u0026nbsp;20\u0026nbsp;30\u0026nbsp;40 \u003cbr\u003e\n7\u0026nbsp;5\u0026nbsp;12\u003cbr\u003e\n125\u0026nbsp;15\u0026nbsp;25 \n"}},{"title":"Sample Output","value":{"format":"HTML","content":"22\u003cbr\u003e\n20\u003cbr\u003e\n1\u003cbr\u003e\n25"}}]}