[Water]Hdu 1022 Train Problem I

#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>

using namespace std;

int n;
string a,b;
string ans;

stack<char>s;
queue<int>q;

int main(){
	while(cin>>n>>a>>b){

		int index1=1,index2=0;
		bool ok=true;

		while(!q.empty())q.pop();
		while(!s.empty())s.pop();

		q.push(1);
		s.push(a[0]);

		while(index2<n){
			if(s.empty()){
				if(index1==n){
					ok=false;
					break;
				}

				q.push(1);
				s.push(a[index1]);
				index1++;
			}
			if(s.top()==b[index2]){
				q.push(0);
				s.pop();
				index2++;
			}else{
				if(index1==n){
					ok=false;
					break;
				}

				q.push(1);
				s.push(a[index1]);
				index1++;
			}
		}

		if(ok){
			cout<<"Yes."<<endl;
			while(!q.empty()){
				if(q.front()==1)cout<<"in"<<endl;
				else cout<<"out"<<endl;
				q.pop();
			}
		}
		else cout<<"No."<<endl;
		cout<<"FINISH"<<endl;
	}
}