#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
const long long INF = 1e18;
const long long inf = -1e18;
const long long MOD = 1e9 + 7;
const long long base = 1000 * 1000 * 1000;
int gcd(int a, int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int A_Reached, A_Lost, B_Reached, B_Lost;
void solve() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int t, x, y;
    cin >> t >> x >> y;
    if (t == 1) {
      A_Reached += x;
      A_Lost += y;
    } else {
      B_Reached += x;
      B_Lost += y;
    }
  }
  if (A_Reached >= A_Lost)
    cout << "LIVE" << '\n';
  else
    cout << "DEAD" << '\n';
  if (B_Reached >= B_Lost)
    cout << "LIVE" << '\n';
  else
    cout << "DEAD" << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
}
