#include<stdio.h>

#include<stack>

#include<string.h>

#define N 20

using namespace std;

int main()

{

    stack<char>S;

    int n, i, j, k, a[N];

    char s1[N], s2[N];

    while(scanf("%d", &n) != EOF)

    {

        while(!S.empty())//清空栈

            S.pop();

        scanf("%s%s", s1, s2);

        j = k = ;

        memset(a, , sizeof(a));

        for(i =  ; i < n ; i++)

        {

            S.push(s1[i]);//入栈

            a[k++] = ；//进栈标记

            while(!S.empty() && S.top() == s2[j])//栈首相同

            {

                a[k++] = ;//出栈标记

                S.pop();//出栈

                j++;//j右移

            }

        }

        if(j == n)

        {

            printf("Yes.\n");

            for(i =  ; i < k ; i++)

                if(a[i] == )

                    printf("in\n");

                else

                    printf("out\n");

        }

        else

            printf("No.\n");

        printf("FINISH\n");

    }

    return ;

}