h du1022 火车进站

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<stack>
using namespace std;
int main(){
   stack<char> q;
   int n;
   char s1[100];
   char s2[100];
   int a[30];
   while(cin>>n){
       while(!q.empty()){//切记此循环，少了WA
       
           q.pop();
       
       }
       cin>>s1;
       cin>>s2;
       int i=0;
       int j=0;
       int sn=0;
       while(j<n){
            if(s1[i]==s2[j]){
                 a[sn++]=0;
                 a[sn++]=1;
                 i++;
                 j++;
                }
             else if(!q.empty()&&q.top()==s2[j])
                 {
                       //cout<<q.top()<<endl;
                       a[sn++]=1;
                       q.pop();
                       j++;
                 }

             else {
                 //cout<<s1[i]<<"df"<<endl;
                q.push(s1[i]);
                a[sn++]=0;
                i++;
             }
        }
            if(q.empty()){
               cout<<"Yes."<<endl;
               for(int i=0;i<2*n;i++)
                 if(a[i]==0)
                   cout<<"in"<<endl;
                 else
                   cout<<"out"<<endl;
                 cout<<"FINISH"<<endl;
            }
            else{
              cout<<"No."<<endl;
              cout<<"FINISH"<<endl;
            }








   }






}