#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
map<string,vector<string> >adj;
map<string,bool>vis;
int cnt=0;
bool iya(char cur){
if(cur-'0'>=0 && cur-'0'<=9)return true;
return false;
}
void dfs(string cur){
if(iya(cur[0]))cnt++;
vis[cur]=true;
for(auto r : adj[cur]){
if(vis[r])continue;
dfs(r);
}
}
signed main(){
cin>>n;
string a[n+1],b[n+1];
for(int q=1;q<=n;q++){
cin>>a[q];
}
for(int q=1;q<=n;q++){
cin>>b[q];
if(a[q]!=b[q]){
adj[a[q]].push_back(b[q]);
adj[b[q]].push_back(a[q]);
}
}
bool oke=true;
for(int q=1;q<=n;q++){
cnt=0;
dfs(a[q]);
if(cnt>1)oke=false;
}
if(oke){
cout<<"DA"<<endl;
}
else{
cout<<"NE"<<endl;
}
}
