1 #include <cmath>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <climits>
 6 #include <map>
 7 #include <set>
 8 #include <queue>
 9 #include <stack>
10 #include <vector>
11 #include <string>
12 #include <iostream>
13 #include <algorithm>
14 
15 
16 #define N 100010
17 
18 using namespace std;
19 
20 typedef long long int ll;
21 
22 int main()
23 {
24     int n;
25     while(cin>>n){
26         char ch;
27         stack<char> sk;     //栈
28         vector<char> vc1;   //进入顺序
29         vector<char> vc2;   //驶出顺序
30         vector<int> time;   //记录in/out
31         //输入字符
32         for(int i=0; i<n; i++){
33             cin>>ch;
34             vc1.push_back(ch);
35         }
36         for(int i=0; i<n; i++){
37             cin>>ch;
38             vc2.push_back(ch);
39         }
40         //i, j用来遍历
41         int i, j;
42         i=j=0;
43         while(i<n && j<n){
44             if(vc1[i]!=vc2[j]){
45                 sk.push(vc1[i]);
46                 time.push_back(1);
47                 i++;
48             }
49             else if(vc1[i] == vc2[j]){
50                 //模拟一次弹栈出栈的过程
51                 time.push_back(1);
52                 time.push_back(0);
53                 i++, j++;
54                 //将可能在栈内的数弹出
55                 if(!sk.empty()){
56                     while(!sk.empty() && j<n && vc2[j]==sk.top()){
57                         sk.pop();
58                         time.push_back(0);
59                         j++;        //将相同的数字弹出栈
60                     }
61                 }
62             }
63         }
64         int flag=1;
65         if(i==n && j<n){
66         //检验剩下的顺序是否正确
67             while(j<n){
68                 if(vc2[j]!=sk.top()){
69                     flag=0;
70                     break;
71                 }
72                 else{
73                     time.push_back(0);
74                     sk.pop();
75                     j++;
76                 }
77             }
78         }
79         else if(j==n && i<n) flag=0;  //没找到这样的样例，以防万一还是写吧^^
80         //顺序正确的话
81         if(flag) {
82             printf("Yes.\n");
83             n=time.size();
84             for(i=0; i<n; i++){
85                 if(time[i]) printf("in\n");
86                 else printf("out\n");
87             }
88         }
89         else printf("No.\n");
90         printf("FINISH\n");
91         //多实例，清空
92         time.clear();
93         while(!sk.empty()) sk.pop();
94         vc1.clear();
95         vc2.clear();
96     }
97     return 0;
98 }