#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<deque>
#include<queue>
#include<sstream>
#include<stack>
#include<bitset>
#include<numeric>
#include<utility>
#include<iomanip>
#include<list>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<string.h>

using namespace std;

#define eps 1e-11
#define INF 1000000009
#define PI 3.14159265358979323
#define sz(a) ((int)a.size())
#define pb push_back
#define mset(a,h) memset(a,h,sizeof(a))
#define wh(a) (a).begin(),(a).end()
#define all(a) (a).begin(),(a).end()
#define REP(i,n) for(__typeof(n) i=0;i<(n);++i)
#define REPS(i,n) for(int(i)=0;i<sz(n);++i)
#define FOR(i,a,b) for(__typeof(b) i=(a);i<=(b);++i)
#define FORD(i,a,b) for(__typeof(a) i=(a);i>=(b);--i)
#define FORE(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define SQR(a) ((a)*(a))
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
typedef long long LL;
int S;
char ch;
vector< vector<int> > M[105];
pii GAP[105];
int VIS[100][24*60];
string Dig[11][5]={
  " - ",
  "| |",
  " . ",
  "| |",
  " - ",

  " . ",
  ". |",
  " . ",
  ". |",
  " . ",

  " - ",
  ". |",
  " - ",
  "| .",
  " - ",
	
  " - ",
  ". |",
  " - ",
  ". |",
  " - ",

  " . ",
  "| |",
  " - ",
  ". |",
  " . ",

  " - ",
  "| .",
  " - ",
  ". |",
  " - ",

  " - ",
  "| .",
  " - ",
  "| |",
  " - ",

  " - ",
  ". |",
  " . ",
  ". |",
  " . ",

  " - ",
  "| |",
  " - ",
  "| |",
  " - ",

  " - ",
  "| |",
  " - ",
  ". |",
  " - ",

  " . ",
  ". .",
  " . ",
  ". .",
  " . ",

};
char MAT[5][3*4];
string TtoTs(vector<int> t)
{
	memset(MAT,' ',sizeof(MAT));
  REPS(i,t)
	{
	  REP(j,5)
			REP(k,3)
			  MAT[j][i*3+k]=Dig[t[i]][j][k];
	}
	string s="";
	REP(i,5)
		REP(j,3*4)
      if (MAT[i][j]!=' ') 
		   s+=MAT[i][j];
	return s;
}
vector<int> tov(int h,int m)
{
	vector<int> v;
	v.pb(h/10);
	if (v[0]==0)v[0]=10;
	v.pb(h%10);
  v.pb(m/10);
	v.pb(m%10);
  return v;
}
void prv(vector<int> v)
{
	if (v[0]!=10)
		printf("%d",v[0]);
	printf("%d:%d%d\n",v[1],v[2],v[3]);
}
set<vector<int> > SEEN;
pii vtop(vector<int> v)
{
	pii res;
	res.fi=(v[0]==10?0:v[0])*10+v[1];
	res.se=v[2]*10+v[3];
	return res;
}
int dist(vector<int> a,vector<int> b,int dir)
{
	pii ap=vtop(a);
	pii bp=vtop(b);
	int ma=ap.fi*60+ap.se;
	int mb=bp.fi*60+bp.se;
//	cout<<"dist : "<<ap.fi<<" "<<ap.se<<", "<<bp.fi<<" "<<bp.se<<" "<<ma<<" "<<mb<<endl;
  if (dir==-1)
	{
	  if (mb<=ma)
			return ma-mb;
    return ma+24*60-mb;
	}
	if (ma<=mb)
		return mb-ma;
	return 24*60-ma+mb;
}
set<vector<int> > cur;
set<vector<int> >nxt;
int solve(int k,vector<int> v,int dir)
{
	cur.clear();
	cur.insert(v);
  for (int i=k+dir;i>=0 && i<S;i+=dir)
	{
	  int from=i-dir,to=i;
    nxt.clear();
		FORE(it,cur)
			FORE(jt,M[to])
		  {
        pii gap=GAP[min(from,to)];
				int curd=dist(*it,*jt,dir);
				if (curd>=gap.fi && curd<=gap.se)
					nxt.insert(*jt);		
		  }
		cur=nxt;
	}	
	return sz(cur);
}
int main()
{
  while(scanf("%d",&S),S)
	{
		REP(k,S)
		{
			string s="";
			REP(i,28)
			{
				cin>>ch;
				s+=ch;	      			
			}
		  if (k!=S-1)
        scanf("%d %d",&GAP[k].fi,&GAP[k].se);
			M[k].clear();
			REP(h,24)
				REP(m,60)
				{
					vector<int> cur_t=tov(h,m);
					string cur_ts=TtoTs(cur_t);
					bool isOk=1;
					REPS(i,cur_ts)
						if (cur_ts[i]!=s[i] && s[i]!='?')
						{
							isOk=0;
							break;
						}
					if (isOk)M[k].pb(cur_t);
				}

		}

		REP(k,S)
		{
			int val=k==0?1:k==S-1?2:0;
			if (k==0 && k==S-1) val=3;
			REPS(i,M[k])
			  VIS[k][i]=val;
		}
		REP(k,S-1)
		{
      pii gap=GAP[k];
			int od=gap.fi,po=gap.se;
			REPS(i,M[k])
			  if (VIS[k][i]&1)
					REPS(j,M[k+1])
					{
					  int d=dist(M[k][i],M[k+1][j],1);
//						cout<<"VZD : "<<d<<endl;
//						if (k==1) cout<<"krok z : "<<i<<" do "<<j<<" za : "<<d<<" hran: "<<od<<" "<<po<<endl;
						if (od<=d&& d<=po)
						{
							VIS[k+1][j]|=1;
//							if (k==1)cout<<"do k+1"<<endl;
						}
//						if (d>po)break;							
					}
		}	
/*		cout<<"DEBUG"<<endl;
	  REP(i,S)
		{
			cout<<"pos : "<<i<<endl;
			REPS(j,M[i])
			if (VIS[i][j])
			{
				cout<<VIS[i][j]<<" ";
				prv(M[i][j]);
			}
		}
	*/	  	
	//	cout<<"----DEBUG"<<endl;				  
		FORD(k,S-1,1)
		{
      pii gap=GAP[k-1];
			int od=gap.fi,po=gap.se;
			REPS(i,M[k])
			  if (VIS[k][i]&2)
					REPS(j,M[k-1])
					{
					  int d=dist(M[k][i],M[k-1][j],-1);
						if (od<=d&& d<=po)
							VIS[k-1][j]|=2;
//						if (d>po)break;							
					}
		}		
				




		REP(k,S)
		{
			int cnt=0;
			vector<int> sol;
			REPS(i,M[k])
			{
				vector<int> v=M[k][i];
				if (VIS[k][i]==3)
				{
					cnt++;
					sol=v;
				}
			}
			if (cnt==1)
				prv(sol);
			else
				printf("ambiguous, %d possibilities\n",cnt);

		}
		putchar('\n');


	}
	return 0;
}