#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
int l[N], r[N], d[N], u[N], i, n, can;
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n;
can = 1;
for (i = 1; i <= n; i++) cin >> l[i];
for (i = 1; i <= n; i++) cin >> r[i];
for (i = 1; i <= n; i++) cin >> u[i];
for (i = 1; i <= n; i++) cin >> d[i];
for (i = 1; i <= n; i++)
{
if (l[i] + r[i] > n) can = 0;
if (u[i] + d[i] > n) can = 0;
if (l[i] == -1 && r[i] != -1) can = 0;
if (l[i] != -1 && r[i] == -1) can = 0;
if (d[i] == -1 && u[i] != -1) can = 0;
if (d[i] != -1 && u[i] == -1) can = 0;
}
cout << (can ? "DA" : "NE");
}
