Mahasena

Problem statement

A strategy-game academy evaluates a squad using a deliberately simple equipment rule. A trainee is marked ready when their weapon count is even and marked unready when it is odd. The academy’s legacy scoreboard displays READY FOR BATTLE only if ready trainees form a strict majority. Your task is to reproduce this classification for the supplied squad. Your task Count how many of the n weapon counts are even and how many are odd. If the even count is greater than the odd count, print READY FOR BATTLE. Otherwise print NOT READY. The decision depends on the number of trainees in each group, not the total number of weapons. Important details A tie is not enough for readiness. Zero is even if it appears. Preserve the uppercase output wording and spaces exactly as specified by the scoreboard. Worked example For weapon counts [2,3,4,6,7], three trainees have even counts and two have odd counts. The squad receives READY FOR BATTLE.

Input format

First line: n. Second line: n nonnegative weapon counts.

Output format

Print READY FOR BATTLE or NOT READY.

Constraints

1 <= n <= 1000; each weapon count is 0..1000000.

Sample input

5
2 3 4 6 7

Sample output

READY FOR BATTLE