For the first Sample Input, we let train 1 get in, then train 2 and train 3.
So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1.
In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3.
Now we can let train 3 leave.
But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment.
So we output "No.".

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

int main()

{

    int n,i,j;

    string str1,str2;

    while(cin>>n>>str1>>str2)

    {

        stack<char> s;

        vector<string> v;

        for( i=,j=;i<n&&j<n;i++)

        {

            s.push(str1[i]);//元素进栈

            v.push_back("in");//字符压进容器

            while(s.top()==str2[j])//匹配

            {

                if(!s.empty())

                {

                    s.pop();

                    v.push_back("out");

                }

                j++;

                if(s.empty())

                    break;

            }

        }

        if(j==n)//判断依据

        {

            printf("Yes.\n");

            for(i=;i<v.size();i++)

                cout<<v[i]<<endl;

            cout<<"FINISH"<<endl;

        }else

        {

            cout<<"No."<<endl<<"FINISH"<<endl;

        }

    }

    return ;

}