说明：  第四届华为杯程序设计竞赛选拔赛A题。问题输入 输入包括多个测试用例，首先给出测试用例数N，接着给出N个测试用例。 每一个测试用例包括1行，依次给出评委的投票，代表投票的数字1或2之间没有空格。 N为正整数，N≤1000。 问题输出 输出包括多行，对于每个测试用例输出一行，给出参赛团体1和参赛团体2之间的胜负关系，具体输出1>2，或1<2，或1=2，其含义如下： ● 1>2 表示参赛团体1胜利 ● 1<2表示参赛团体2胜利 ● 1=2表示参赛团体1和参赛团体2打平 样例输入 3 12 112 122 样例输出 1=2 1>2 1<2
(Huawei Cup fourth qualifying Programming Contest A title. Problem input Inputs include multiple test cases, test cases given first number N, then given N test cases. Including a line for each test case, given the judges turn to vote, there is no space between the figures represent 1 or 2 votes. N is a positive integer, N ≤ 1000. Problem Output The output includes multiple lines, one line of output for each test case, given the outcome of the relationship between two participating groups between 1 and participating groups, the specific output 1> 2, or 1 <2, or 1 = 2, and its meaning is as follows: ● 1> 2 represents a victory of participating organizations ● 1 <2 2 victory, said participating groups ● 1 = 2 means that participating organizations participating groups 1 and 2 tie Sample Input 3 12 112 122 Sample Output A = 2 1> 2 1 <2)