//#include <bits\stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <ctime>
#include <set>
#include <cmath>
#define sqr(x) (x)*(x)
#define eps 1e-10
#define lson (p<<1)
#define rson (lson | 1)
//#define pair<int,int> pii

using namespace std;
const int N = 1e3+10;
const int M = 1e6+10;
typedef long long llg;
int n;
map<string,int > ma[N],mb[N];
map<string,int >::iterator it;
vector<int>ve;
string s,tmp;
bool fz[N];
int main()
{
    scanf("%d",&n) ;
    {
        for(int i=0;i<n;i++) ma[i].clear(),mb[i].clear();
        for(int i=0,x;i<n;i++)
        {
            fz[i] = 1;
            while(1)
            {
                cin >> s >> tmp;
                //cout<<s<<tmp<<endl;
                scanf("%d",&x);
                if(ma[i].find(s) == ma[i].end() ) ma[i][s]=-10010 ,mb[i][s] = 10010;
                if(tmp[0] == '=')
                {
                    ma[i][s] = max(ma[i][s],x);
                    mb[i][s] = min(mb[i][s],x);
                } else
                {
                    if(tmp[0] == '<')
                    {
                        mb[i][s] = min(mb[i][s],x - (tmp.size() == 1) );
                    }
                    if(tmp[0] == '>')
                    {
                        ma[i][s] = max(ma[i][s],x + (tmp.size() == 1));
                    }
                }
                if(ma[i][s] > mb[i][s]) fz[i] = 0;
                char c;
                int tmp = 0;
                while(tmp = scanf("%c",&c),tmp!=-1&& c==' ');
                if(c == '\n' || tmp == -1) break;
            }
            ve.clear();
            if(fz[i])
            for(int j=0;j<i;j++)
            {
                if(!fz[j]) continue;
                bool flag = 1;
                for(it=ma[i].begin();it!=ma[i].end();it++)
                {
                    if(ma[j].find(it->first) != ma[j].end() )
                    {
                        if(mb[j][it->first] < it->second || ma[j][it->first] > mb[i][it->first] )
                        {
                            flag = 0;
                            break;
                        }
                    } 
                }
                if(flag) ve.push_back(j+1);
            }
            if(ve.size() == 0) printf("unique\n");
            else for(int j=0;j<ve.size();j++) printf("%d%c",ve[j],ve[j]==ve.back()?'\n':' ' );
        }
    }
    return 0;
}