The first line contains a integer N ( 1 ≤ N ≤ 1000).
The next N lines contain the S_i, T_i and D_i. S_i and T_i are in the format of hh:mm.

The first line of output contains "YES" or "NO" indicating whether John can be present at every special ceremony. If it is "YES", output another N lines describing the staring time and finishing time of all the ceremonies.

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int N=2008;
struct node{
   int st,ed;
}e[N];
int dfn[N],low[N],bl[N],in[N],q[N],col[N],con[N];
bool instack[N];
int cnt,scnt,l,n;
vector<int>v[N];
vector<int>g[N];
void init(){
    memset(dfn,0,sizeof(dfn));
    memset(low,0,sizeof(in));
    memset(col,0,sizeof(col));
    memset(instack,0,sizeof(instack));
    for(int i=0;i<=2*n;++i) v[i].clear(),g[i].clear();
    cnt=scnt=l=0;
}
inline void add(int a,int b){v[a].push_back(b);}
void Tarjan(int u){
    low[u]=dfn[u]=++cnt;
    q[l++]=u;
    instack[u]=1;
    for(int i=0;i<(int)v[u].size();++i){
        int x=v[u][i];
        if(!dfn[x]){
            Tarjan(x);
            low[u]=min(low[u],low[x]);
        }
        else if(instack[x]&&dfn[x]<low[u]) low[u]=dfn[x];
    }
    if(low[u]==dfn[u]){
        int t;++scnt;
        do{
            t=q[--l];
            instack[t]=0;
            bl[t]=scnt;
        }while(t!=u);
    }
}
void rebuild(){
   for(int i=0;i<2*n;++i) for(int j=0;j<(int)v[i].size();++j){
    int a=bl[i],b=bl[v[i][j]];
    if(a==b) continue;
    ++in[a];
    g[b].push_back(a);
   }
}
void topsort(){
   queue<int>Q;
   for(int i=1;i<=scnt;++i) if(!in[i]) Q.push(i);
   while(!Q.empty()){
    int u=Q.front();
    Q.pop();
    if(!col[u]) {
        col[u]=1;
        col[con[u]]=2;
    }
    for(int i=0;i<(int)g[u].size();++i){
        int x=g[u][i];
        --in[x];
        if(in[x]==0) Q.push(x);
    }
   }
}
void solve(){
   for(int i=0;i<2*n;++i) if(!dfn[i]) Tarjan(i);
   for(int i=0;i<n;++i) {
     if(bl[2*i]==bl[2*i+1]) {puts("NO");return;}
     int a=bl[2*i],b=bl[2*i+1];
     con[a]=b;con[b]=a;
   }
   rebuild();
   topsort();
   puts("YES");
   for(int i=0;i<2*n;i+=2){
    if(col[bl[i]]==1) {
        int h1=e[i].st/60,m1=e[i].st%60,h2=e[i].ed/60,m2=e[i].ed%60;
        printf("%02d:%02d %02d:%02d\n",h1,m1,h2,m2);
    }
    else {
        int h1=e[i^1].st/60,m1=e[i^1].st%60,h2=e[i^1].ed/60,m2=e[i^1].ed%60;
        printf("%02d:%02d %02d:%02d\n",h1,m1,h2,m2);
    }
   }
}
int getx(char *s){
   int h,m;
   h=(s[0]-‘0‘)*10+s[1]-‘0‘;
   m=(s[3]-‘0‘)*10+s[4]-‘0‘;
   return h*60+m;
}
bool Ju(const node &a,const node &b){
   if (b.st>=a.st && b.st < a.ed) return 1;
   if(a.st>=b.st && a.st < b.ed) return 1;
   return 0;
}
int main(){
   char st[8],ed[8];
   int time;
   while(scanf("%d",&n)!=EOF){
    init();
    for(int i=0;i<n;++i){
        scanf("%s %s %d",st,ed,&time);
        e[2*i].st=getx(st);e[2*i].ed=getx(st)+time;
        e[2*i+1].st=getx(ed)-time;e[2*i+1].ed=getx(ed);
    }
    for(int i=0;i<2*n;++i)
    for(int j=i+1;j<2*n;++j){
         if(i==(j^1)) continue;
         if(Ju(e[i],e[j])) {add(i,j^1);add(j,i^1);}
    }
    solve();
   }
}