|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||2||2||2||100.000%|
Andi is a young and prominent detective in the police force. His ability to track down criminals, uncover the truth, and solve cases never ceases to amaze all of his colleagues. One day, he is faced with a suspicious eyewitness testimony when working on a certain case. In usual cases, Andi simply ignores such unreliable testimony; however, in this case, the eyewitness testimony is too important to be ignored. To resolve this situation, Andi has to rely on technology, i.e. using a lie detector.
Andi proceeds to use a lie detector to detect whether the eyewitness testimony is true. However, Andi notices that the lie detector he used might have been tampered, thus, he employs a second lie detector to detect whether the first lie detector’s result is correct. This situation happens repeatedly such that Andi ends up employing N lie detectors in total. The ith lie detector reports the truth of the (i−1)th lie detector for i = 2..N, and the 1st lie detector reports the truth of the eyewitness testimony.
In the end, Andi knows that the last (Nth) lie detector has not been tampered and always report the truth correctly. Now, he needs to determine whether the eyewitness testimony is true given the result of all lie detectors.
For example, let N = 4 and the lie detectors result are (LIE, LIE, TRUTH, TRUTH).
Therefore, the eyewitness testimony in this example is true.
Input begins with a line containing an integer N (2 ≤ N ≤ 100000). The next N lines, each contains a string Si (either TRUTH or LIE) representing the output of the ith lie detector for i = 1..N respectively.
Output contains a string TRUTH or LIE in a line whether the eyewitness testimony is true or false.
4 LIE LIE TRUTH TRUTH
This sample is illustrated in the problem description above.
3 LIE LIE LIE