#include <bits/stdc++.h>
using namespace std;
#define task "main"
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
const int MAX_N = (int)1e5 + 5;
int numRect;
int x1[MAX_N], x2[MAX_N];
int yu[MAX_N], yv[MAX_N];
int ID(int x, vector<int> &com) {
return lower_bound(com.begin(), com.end(), x) - com.begin() + 1;
}
int compress() {
vector<int> comX, comY;
FOR(i, 1, numRect) comX.push_back(x1[i]), comX.push_back(x2[i]), comY.push_back(yu[i]), comY.push_back(yv[i]);
sort(comX.begin(), comX.end());
sort(comY.begin(), comY.end());
comX.erase(unique(comX.begin(), comX.end()), comX.end());
comY.erase(unique(comY.begin(), comY.end()), comY.end());
FOR(i, 1, numRect) x1[i] = ID(x1[i], comX), x2[i] = ID(x2[i], comX), yu[i] = ID(yu[i], comY), yv[i] = ID(yv[i], comY);
return (int)comY.size();
}
vector<int> addPoint[2 * MAX_N], delPoint[2 * MAX_N];
bool isCovered[MAX_N], isActive[MAX_N];
struct IT {
struct NODE {
// 0: segments [yu, yv] that are fully contained inside [l, r]
// 1: remain cases
priority_queue<int> active[2];
priority_queue<int, vector<int>, greater<int>> uncoverd[2];
} tree[8 * MAX_N];
void cover(int rectID, priority_queue<int, vector<int>, greater<int>> &pq) {
while (!pq.empty() && (pq.top() < rectID || !isActive[pq.top()] || isCovered[pq.top()])) {
if (isActive[pq.top()]) isCovered[pq.top()] = 1;
pq.pop();
}
}
int getMaxID(priority_queue<int> &pq) {
while (!pq.empty() && !isActive[pq.top()]) pq.pop();
return (pq.empty() ? -1 : pq.top());
}
void insert(int id, int l, int r, int requestL, int requestR, int rectID) {
if (l > requestR || r < requestL) return;
if (l >= requestL && r <= requestR) { // [l, r] contains [requestL, requestR]
cover(rectID, tree[id].uncoverd[1]);
if (getMaxID(tree[id].active[1]) > rectID) isCovered[rectID] = 1;
if (!isCovered[rectID]) {
tree[id].uncoverd[0].push(rectID);
tree[id].uncoverd[1].push(rectID);
}
tree[id].active[0].push(rectID);
tree[id].active[1].push(rectID);
return;
}
cover(rectID, tree[id].uncoverd[0]);
if (getMaxID(tree[id].active[0]) > rectID) isCovered[rectID] = 1;
else tree[id].uncoverd[1].push(rectID);
tree[id].active[1].push(rectID);
int mid = (l + r) >> 1;
insert(2 * id, l, mid, requestL, requestR, rectID);
insert(2 * id + 1, mid + 1, r, requestL, requestR, rectID);
}
} segTree;
void solve() {
cin >> numRect;
FOR(i, 1, numRect) {
int x, y, a, b;
cin >> x >> y >> a >> b;
x1[i] = x, x2[i] = x + a;
yu[i] = y, yv[i] = y + b - 1;
}
int m = compress();
FOR(i, 1, numRect) {
addPoint[x1[i]].push_back(i);
delPoint[x2[i]].push_back(i);
isCovered[i] = isActive[i] = 0;
}
FOR(point, 1, m) {
for (int id : delPoint[point]) isActive[id] = 0;
for (int id : addPoint[point]) {
segTree.insert(1, 1, m, yu[id], yv[id], id);
isActive[id] = 1;
}
}
FOR(i, 1, numRect) cout << (isCovered[i] ? "NE" : "DA") << "\n";
}
int32_t main() {
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
bool multitest = 0;
int numTest = 1;
if (multitest) cin >> numTest;
while (numTest--) {
solve();
}
return 0;
}
/* Lak lu theo dieu nhac!!!! */
