Best of N

Difficulty: 900 3000 ms 128 MB

implementation

Alice and Bob play N rounds of rock-paper-scissors (R beats S, S beats P, P beats R). Print the overall winner (ALICE, BOB or DRAW).

Input: the first line has N; the second line has Alice's moves; the third has Bob's.

Output: the series result.

Constraints:

• 1 ≤ N ≤ 10⁵

Sample Tests

3
R P S
S P R

DRAW

1
R
R

DRAW

Read the Editorial