#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v) for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout<<it<<" ";cout<<endl;
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
bool is_num(string s)
{
for(char ch : s)
{
if(!isdigit(ch))
{
return false;
}
}
return true;
}
void solve()
{
int n;
cin>>n;
vector<string> a(n),b(n);
for(int i=0;i<n;++i)
{
cin>>a[i];
}
for(int i=0;i<n;++i)
{
cin>>b[i];
if(b[i]!=a[i]&&is_num(a[i])&&is_num(b[i]))
{
cout<<"NE\n";
return;
}
}
cout<<"DA\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
//int t;cin>>t;while(t--)
solve();
return 0;
}
