1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;
int N;
struct Node{
    int flag;
    int C;
}node[53];
int main(){
    char str[3];
    while(cin>>N){
        for(int i=0; i<N; ++i){
            cin>>str;
            cin>>str;
            if(str[1]==0){
                switch(str[0]){
                    case '<':
                        node[i].flag=0;
                        break;
                    case '=':
                        node[i].flag=1;
                        break;
                    case '>':
                        node[i].flag=2;
                        break;
                }
            }else{
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX