#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
struct node
{
    int a,b;
}a[3][1005][105],tmp;
int n,m,N,i,j,k,l,o,x;
char s[100000],c[100][100],c1[100];
bool b[1005],b1[1005];
bool check(node x,node y)
{
    if(x.a>y.a)swap(x,y);
    if(!x.a)return 1;
    if(x.a==1&&y.a!=1&&y.b>x.b||x.a==2&&y.a==3&&y.b<x.b||x.a==3&&y.a==3&&x.b!=y.b)return 0;
    return 1;
}
int main()
{
    scanf("%d\n",&n);
    for(i=1;i<=n;i++)
    {
        gets(s);
        m=strlen(s);
        for(j=0;;)
        {
            for(;s[j]<'a'||s[j]>'z';j++);
            for(k=0;s[j]>='a'&&s[j]<='z';j++)c1[k++]=s[j];
            for(l=0;l<N;l++)if(!strcmp(c1,c[l]))break;
            if(l==N)
            {
                for(o=0;o<k;o++)c[N][o]=c1[o];
                N++;
            }
            for(;s[j]!='<'&&s[j]!='>'&&s[j]!='=';j++);
            o=0;
            if(s[j]=='<')
            {
                tmp.a=1;
                if(s[j+1]!='=')o=-1;
            }
            else if(s[j]=='=')tmp.a=3;
            else
            {
                tmp.a=2;
                if(s[j+1]!='=')o=1;
            }
            for(;s[j]!='-'&&(s[j]<'0'||s[j]>'9');j++);
            k=1;
            if(s[j]=='-')
            {
                k=-1;
                j++;
            }
            for(x=0;s[j]>='0'&&s[j]<='9';j++)x=x*10+(s[j]^'0');
            x=x*k+o;
            tmp.b=x;
            if(check(tmp,a[1][i][l])&&check(tmp,a[2][i][l])){if(!a[tmp.a][i][l].a)a[tmp.a][i][l]=tmp;
            else if(tmp.a==1&&a[1][i][l].a!=3&&a[1][i][l].b>tmp.b)a[1][i][l].b=tmp.b;
            else if(tmp.a==2&&a[2][i][l].a!=3&&a[2][i][l].b<tmp.b)a[2][i][l].b=tmp.b;
            else if(tmp.a==3)a[1][i][l]=a[2][i][l]=tmp;}
            else
            {
                b1[i]=1;
                break;
            }
            for(;j<m&&s[j]!=',';j++);
            if(j==m)break;
        }
    }
    for(i=1;i<=n;i++)
    {
        memset(b,0,sizeof(b));
        if(!b1[i])for(j=1,l=0;j<i;j++)if(!b1[j])
        {
            for(k=0;k<N;k++)if(!check(a[1][i][k],a[2][j][k])||!check(a[2][i][k],a[1][j][k]))break;
            if(k==N)b[j]=l=1;
        }
        if(l&&!b1[i]){for(j=1;j<i;j++)if(b[j]){if(l)l=0;else printf(" ");printf("%d",j);}}
        else printf("unique");
        puts("");
    }
    return 0;
}