#include <iostream>
using namespace std;

typedef struct BTNode {
	int value;
	struct BTNode* lc, * rc;
}BTNode, * BST;
void InsertTree(BST& T, int x)
{
	if (T == NULL)
	{
		T = new BTNode;
		T->value = x;
		T->lc = NULL;
		T->rc = NULL;
		return;
	}
	if (T->value == x)
		return;
	else if (T->value > x)
		InsertTree(T->lc, x);
	else
		InsertTree(T->rc, x);
}
void preorder(BST T, string& s)
{
	if (T)
	{
		s += T->value;
		preorder(T->lc, s);
		preorder(T->rc, s);
	}
}
void DeleteTree(BST& T)
{
	if (T)
	{
		DeleteTree(T->lc);
		DeleteTree(T->rc);
		delete T;
	}
}
int main()
{
	int n;
	while (cin >> n)
	{
		if (n == 0)
			break;
		BST T = NULL;
		string s;
		cin >> s;
		for (int i = 0; i < s.size(); i++)
			InsertTree(T, s[i] - '0');
		string ori;
		preorder(T, ori);//get T's inorder sequence;
		for (int i = 0; i < n; i++)
		{
			string test;
			cin &g...