HDJ -- 1022

 #include<iostream>
 #include<cstdio>
 #include<string>
 #define MAXN 10
 using namespace std;
 int s[MAXN], p[MAXN];
 string in, out;
 int main(){
     int n, flag, k, i, j, top;
     while(~scanf("%d", &n)){
         cin >> in >> out;
         k = flag = i = j = top = ;
         while(i < n){
             if(top && s[top] == out[i]){
                 i++;
                 top--;
                 p[k++] = ;
             }else if(j < n){
                 s[++top] = in[j++];
                 p[k++] = ;
             }else{
                 flag = ;
                 break;
             }
         }
         if(!flag){
             printf("Yes.\n");
             for(int i = ; i < k; i ++) printf("%s\n", p[i] ==  ? "in" : "out");
             printf("FINISH\n");
         }else printf("No.\nFINISH\n");
     }
     return ;
 }