#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <map>#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)<(y)?(x):(y))
#define abs(x) ((x)>=0?(x):-(x))
#define i64 long long
#define u32 unsigned int
#define u64 unsigned long long
#define clr(x,y) memset(x,y,sizeof(x))
#define CLR(x) x.clear()
#define ph(x) push(x)
#define pb(x) push_back(x)
#define Len(x) x.length()
#define SZ(x) x.size()
#define PI acos(-1.0)
#define sqr(x) ((x)*(x))#define FOR0(i,x) for(i=0;i<x;i++)
#define FOR1(i,x) for(i=1;i<=x;i++)
#define FOR(i,a,b) for(i=a;i<=b;i++)
#define DOW0(i,x) for(i=x;i>=0;i--)
#define DOW1(i,x) for(i=x;i>=1;i--)
#define DOW(i,a,b) for(i=a;i>=b;i--)
using namespace std;void RD(int &x){scanf("%d",&x);}
void RD(i64 &x){scanf("%I64d",&x);}
void RD(u32 &x){scanf("%u",&x);}
void RD(double &x){scanf("%lf",&x);}
void RD(int &x,int &y){scanf("%d%d",&x,&y);}
void RD(i64 &x,i64 &y){scanf("%I64d%I64d",&x,&y);}
void RD(u32 &x,u32 &y){scanf("%u%u",&x,&y);}
void RD(double &x,double &y){scanf("%lf%lf",&x,&y);}
void RD(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void RD(i64 &x,i64 &y,i64 &z){scanf("%I64d%I64d%I64d",&x,&y,&z);}
void RD(u32 &x,u32 &y,u32 &z){scanf("%u%u%u",&x,&y,&z);}
void RD(double &x,double &y,double &z){scanf("%lf%lf%lf",&x,&y,&z);}
void RD(char &x){x=getchar();}
void RD(char *s){scanf("%s",s);}
void RD(string &s){cin>>s;}void PR(int x) {printf("%d\n",x);}
void PR(i64 x) {printf("%I64d\n",x);}
void PR(u32 x) {printf("%u\n",x);}
void PR(u64 x) {printf("%llu\n",x);}
void PR(double x) {printf("%.4lf\n",x);}
void PR(char x) {printf("%c\n",x);}
void PR(char *x) {printf("%s\n",x);}
void PR(string x) {cout<<x<<endl;}int n,fNum,mNum;
map<string,int> F,M;
map<string,int>::iterator it;
map<int,string> F1,M1;
char s[15];
string str;
int a[805][805],b[805][805];
int p[805];void input()
{RD(n);fNum=mNum=0;int i,j,x,y;for(i=1;i<=n;i++){scanf("%s",s);str=s;x=M[str]=++mNum;M1[mNum]=str;for(j=1;j<=n;j++){scanf("%s",s);str=s;it=F.find(str);if(it==F.end()){y=F[str]=++fNum;F1[fNum]=str;}else y=(*it).second;b[x][j]=y;}}for(i=1;i<=n;i++){scanf("%s",s);str=s;it=F.find(str);x=(*it).second;for(j=1;j<=n;j++){scanf("%s",s);str=s;it=M.find(str);y=(*it).second;a[x][y]=j;}}
}void deal()
{queue<int> Q;int i,x,y;for(i=1;i<=n;i++) Q.push(i);while(!Q.empty()){x=Q.front();Q.pop();for(i=1;i<=n;i++){y=b[x][i];if(!p[y]){p[y]=x;break;}else if(a[y][x]<a[y][p[y]]){Q.push(p[y]);p[y]=x;break;}}if(i>n) Q.push(x);}
}void print()
{puts("YES");int i;for(i=1;i<=n;i++){cout<<M1[p[i]]<<' '<<F1[i]<<endl;}
}int main()
{input();deal();print();return 0;
}