#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;

const int INF=100000;
const int maxn=1000+5;
map<string,int> ha;
vector<string> v[maxn];

int ma[maxn][35];
int mi[maxn][35];
bool isNull[maxn];

int n;

int main()
{
    cin>>n;
    getchar();

    for(int i=1; i<=n; ++i)
    {
        for(int j=1; j<=30; ++j)
        {
            ma[i][j]=INF;
            mi[i][j]=-INF;
        }
        v[i].clear();
        isNull[i]=false;
    }
    int st=1;ha.clear();

    string s;
    string name,op;
    int val;
    int id;

    for(int i=1; i<=n; ++i)
    {
        getline(cin,s);
        int len=s.length();
        int k=0;
        while(k<len)
        {
            while(k<len&&s[k]<'a'||s[k]>'z') k++;
            name="";
            while(s[k]>='a'&&s[k]<='z') name=name+s[k++];
            while(s[k]==' ')    k++;
            op="";
            while(s[k]=='>'||s[k]=='='||s[k]=='<') op=op+s[k++];
            while(s[k]==' ')    k++;
            val=0;
            while(s[k]>='0'&&s[k]<='9') val=val*10+s[k++]-'0';

            //cout<<name<<op<<val<<endl;
            v[i].push_back(name);
            if(ha[name]==0)
            {
                ha[name]=st++;
            }
            id=ha[name];

            if(op=="<") //name<val;
            {
                ma[i][id]=min(ma[i][id],val-1);
            }
            else if(op=="<=")
            {
                ma[i][id]=min(ma[i][id],val);
            }
            else if(op=="==")
            {
                ma[i][id]=min(ma[i][id],val);
                mi[i][id]=max(mi[i][id],val);
            }
            else if(op==">=")
            {
                mi[i][id]=max(mi[i][id],val);
            }
            else
            {
                mi[i][id]=max(mi[i][id],val+1);
            }
            //cout<<name<<" "<<mi[i][id]<<" "<<ma[i][id]<<endl;

            if(mi[i][id]>ma[i][id])
                isNull[i]=true;
        }
        bool isUnique=true;
        for(int j=1;j<i;++j)
        {
            if(isNull[i])   break;
            if(isNull[j])   continue;
            bool isOK=true;
            for(int it=0;it<v[j].size();++it)
            {
                name=v[j][it];
                id=ha[name];
                if(mi[j][id]>ma[j][id]||mi[i][id]>ma[i][id]||ma[j][id]<mi[i][id]||mi[j][id]>ma[i][id])
                {
                    isOK=false;
                    break;
                }
            }
            if(isOK)
            {
                if(isUnique)
                {
                    isUnique=false;
                }
                else
                    cout<<" ";
                cout<<j;
            }
        }
        if(isUnique)
            cout<<"unique";
        cout<<endl;
    }
    return 0;
}