Polycarpus is a system administrator. There are two servers under his strict guidance — a and b . To stay informed about the servers' performance, Polycarpus executes commands " ping a " and " ping b ". Each ping command sends exactly ten packets to the server specified in the argument of the command. Executing a program results in two integers x and y ( x + y = 10; x , y ≥ 0) . These numbers mean that x packets successfully reached the corresponding server through the network and y packets were lost. Today Polycarpus has performed overall n ping commands during his workday. Now for each server Polycarpus wants to know whether the server is "alive" or not. Polycarpus thinks that the server is "alive", if at least half of the packets that we send to this server reached it successfully along the network. Help Polycarpus, determine for each server, whether it is "alive" or not by the given commands and their results. The first line contains a single integer n (2 ≤ n ≤ 1000) — the number of commands Polycarpus has fulfilled. Each of the following n lines contains three integers — the description of the commands. The i -th of these lines contains three space-separated integers t i , x i , y i (1 ≤ t i ≤ 2; x i , y i ≥ 0; x i + y i = 10) . If t i = 1 , then the i -th command is " ping a ", otherwise the i -th command is " ping b ". Numbers x i , y i represent the result of executing this command, that is, x i packets reached the corresponding server successfully and y i packets were lost. It is guaranteed that the input has at least one " ping a " command and at least one " ping b " command. In the first line print string " LIVE " (without the quotes) if server a is "alive", otherwise print " DEAD " (without the quotes). In the second line print the state of server b in the similar format. Consider the first test case. There 10 packets were sent to server a , 5 of them reached it. Therefore, at least half of all packets sent to this server successfully reached i