1 // Problem#: 8670
 2 // Submission#: 2493920
 3 // The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
 4 // URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
 5 // All Copyright reserved by Informatic Lab of Sun Yat-sen University
 6 #include<iostream>
 7 #include<stack>
 8 #include<string>
 9 #include<vector>
10 #include<stdio.h>
11 using namespace std;
12 int main() {
13     string in_ = "in";
14     string out_ = "out";
15     string finish = "FINISH";
16     string in;
17     string out;
18     int trains;
19
20     while (scanf("%d", &trains) != EOF) {
21           cin >> in >> out;
22           stack<char> station;
23           vector<string> state;
24           for (int i = 0; i < in.size(); i++) {
25               if (in[i] == out[0]) {
26                   state.push_back(in_);
27                   state.push_back(out_);
28                   out.erase(out.begin());
29                   while (!station.empty()) {//关键一步
30                        if (station.top() == out[0]) {
31                            state.push_back(out_);
32                            out.erase(out.begin());
33                            station.pop();
34                        } else
35                           break;
36                   }
37               } else {
38                   station.push(in[i]);
39                   state.push_back(in_);
40               }
41           }
42           state.push_back(finish);
43           if (station.empty()) {
44               cout << "Yes." << endl;
45               for (int i = 0; i < state.size(); i++)
46                    cout << state[i] << endl;
47           } else
48               cout << "No." << endl << finish << endl;
49      }
50      return 0;
51 }