#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<stack>
#include<sstream>
#define ll long long
using namespace std;
/*********************************************************************/
const int M_NUM_MAX = 40000+100;
const int M_INT_MAX = 0x7fffffff;
const double M_DBL_MAX = 1.7976931348623158e+308;
const double M_DBL_MIN = 2.2250738585072014e-308;
int theMap[60][60],vis[60];
/*********************************************************************/
int min_2 (int x,int y) {return x<y?x:y;}
bool dfs (int i)//判断图中是否有环的模板
{
vis[i]=-1;//-1表示在当前访问i在递归栈中
for (int j=0;j<52;j++)
if (theMap[i][j]){
if (vis[j]==-1) return false;//如果i能访问到递归栈中的某个点,说明图中有环
else if (vis[j]==0)
if ( !dfs(j) )//如果i的子递归中存在环,也是原图中存在环
return false;
}
vis[i]=1;//已被安全访问完
return true;
}
int getID (char a,char b){return (a-'A')*2+(b=='+'?0:1);}
void connect (char a,char b,char c,char d)
{
if (a=='0'||c=='0') return;
int x=getID(a,b)^1;
int y=getID(c,d);
theMap[x][y]=1;
}
/*********************************************************************/
int main()
{
//freopen ("in.txt","r",stdin);
int n;
while (scanf ("%d",&n)==1&&n)
{
char s[10];
memset (theMap,0,sizeof (theMap));
for (int i=0;i<n;i++){
scanf ("%s",s);
for (int j=0;j<8;j+=2)
for (int k=0;k<8;k+=2)
if (k!=j)
connect (s[j],s[j+1],s[k],s[k+1]);//为什么??
}
bool success=false;
memset (vis,0,sizeof (vis));
for (int i=0;i<52;i++){
if (!vis[i])
if ( !dfs(i) ){
success=true;
break;
}
}
if (success)
printf ("unbounded\n");
else printf ("bounded\n");
}
return 0;
}