#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, i, s = 0, c = 0, d = 0, p = 0, q = 0, w = 0;
  cin >> n;
  int t[n], x[n], y[n];
  for (i = 0; i < n; i++) {
    cin >> t[i] >> x[i] >> y[i];
    if (t[i] == 1) {
      s += x[i];
      c += y[i];
      d += x[i] + y[i];
    } else {
      p += x[i];
      q += y[i];
      w += x[i] + y[i];
    }
  }
  if (s >= (d / 2)) {
    cout << "LIVE" << endl;
  } else
    cout << "DEAD" << endl;
  if (p >= (w / 2))
    cout << "LIVE" << endl;
  else
    cout << "DEAD" << endl;
  return;
}
int main() { solve(); }
