Kattapa, as you all know was one of the greatest warriors of his time. The kingdom of Maahishmati had never lost a battle under him (as army-chief), and the reason for that was their really powerful army, also called as Mahasena.
Kattapa was known to be a very superstitious person. He believed that a soldier is "lucky" if the soldier is holding an even number of weapons, and "unlucky" otherwise. He considered the army as "READY FOR BATTLE" if the count of "lucky" soldiers is strictly greater than the count of "unlucky" soldiers, and "NOT READY" otherwise.
Given the number of weapons each soldier is holding, your task is to determine whether the army formed by all these soldiers is "READY FOR BATTLE" or "NOT READY".
Note: You can find the definition of an even number here.

-----Input-----

The first line of input consists of a single integer N denoting the number of soldiers. The second line of input consists of N space separated integers A1, A2, ..., AN, where Ai denotes the number of weapons that the ith soldier is holding.

-----Output-----
Generate one line output saying "READY FOR BATTLE", if the army satisfies the conditions that Kattapa requires or "NOT READY" otherwise (quotes for clarity).

-----Constraints-----
- 1 ≤ N ≤ 100
- 1 ≤ Ai ≤ 100

-----Example 1-----
Input:
1
1

Output:
NOT READY

-----Example 2-----
Input:
1
2

Output:
READY FOR BATTLE

-----Example 3-----
Input:
4
11 12 13 14

Output:
NOT READY

-----Example 4-----
Input:
3
2 3 4

Output:
READY FOR BATTLE

-----Example 5-----
Input:
5
1 2 3 4 5

Output:
NOT READY

-----Explanation-----

- Example 1: For the first example, N = 1 and the array A = [1]. There is only 1 soldier and he is holding 1 weapon, which is odd. The number of soldiers holding an even number of weapons = 0, and number of soldiers holding an odd number of weapons = 1. Hence, the answer is "NOT READY" since the number of soldiers holding an even number of weapons is not greater than the number of soldiers holding an odd number of weapons.

- Example 2: For the second example, N = 1 and the array A = [2]. There is only 1 soldier and he is holding 2 weapons, which is even. The number of soldiers holding an even number of weapons = 1, and number of soldiers holding an odd number of weapons = 0. Hence, the answer is "READY FOR BATTLE" since the number of soldiers holding an even number of weapons is greater than the number of soldiers holding an odd number of weapons.

- Example 3: For the third example, N = 4 and the array A = [11, 12, 13, 14]. The 1st soldier is holding 11 weapons (which is odd), the 2nd soldier is holding 12 weapons (which is even), the 3rd soldier is holding 13 weapons (which is odd), and the 4th soldier is holding 14 weapons (which is even). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 2. Notice that we have an equal number of people holding even number of weapons and odd number of weapons. The answer here is "NOT READY" since the number of soldiers holding an even number of weapons is not strictly greater than the number of soldiers holding an odd number of weapons.

- Example 4: For the fourth example, N = 3 and the array A = [2, 3, 4]. The 1st soldier is holding 2 weapons (which is even), the 2nd soldier is holding 3 weapons (which is odd), and the 3rd soldier is holding 4 weapons (which is even). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 1. Hence, the answer is "READY FOR BATTLE" since the number of soldiers holding an even number of weapons is greater than the number of soldiers holding an odd number of weapons.

- Example 5: For the fifth example, N = 5 and the array A = [1, 2, 3, 4, 5]. The 1st soldier is holding 1 weapon (which is odd), the 2nd soldier is holding 2 weapons (which is even), the 3rd soldier is holding 3 weapons (which is odd), the 4th soldier is holding 4 weapons (which is even), and the 5th soldier is holding 5 weapons (which is odd). The number of soldiers holding an even number of weapons = 2, and number of soldiers holding an odd number of weapons = 3. Hence, the answer is "NOT READY" since the number of soldiers holding an even number of weapons is not greater than the number of soldiers holding an odd number of weapons.

Difficulty: UNKNOWN_DIFFICULTY

Starter code:

Solutions:
n = int(input())
l = input()
l = l.split()
c = 0
for i in range(len(l)):
	l[i] = int(l[i])
	if l[i] % 2 == 0:
		c += 1
	else:
		c -= 1
if c > 0:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = int(eval(input()))
arr = list(map(int, input().split()))
even = 0
for solder in arr:
	if solder % 2 == 0:
		even += 1
if even > n - even:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


odd = 0
even = 0
eval(input())
for i in map(int, input().split()):
	if i % 2 == 0:
		even += 1
	else:
		odd += 1
if even > odd:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


no_of_sold = int(input())
weapons = input()
weapons = weapons.split(' ')
counter = 0
for wea in weapons:
	if int(wea) % 2 == 0:
		counter += 1
	else:
		counter -= 1
if counter > 0:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


t = int(input())
e = 0
o = 0
a = list(map(int, input().split()))
for i in a:
	if i % 2 == 1:
		o += 1
	else:
		e += 1
if e > o:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


t = int(input())
l = list(map(int, input().split(' ')))
even = 0
odd = 0
for i in l:
	if i % 2 == 0:
		even = even + 1
	else:
		odd = odd + 1
if even > odd:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


N = int(input())
weapon_count = list(map(int, input().split()))
even_count = 0
for w in weapon_count:
	if w % 2 == 0:
		even_count += 1
if even_count > N - even_count:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = int(input())
ev = 0
odd = 0
i = 0
arr = list(map(int, input().split()))
for each in arr:
	if each % 2 == 0:
		ev += 1
	else:
		odd += 1
if ev > odd:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = eval(input())
arr = list(map(int, input().split()))
lucky = 0
for i in arr:
	if i & 1:
		lucky -= 1
	else:
		lucky += 1
if lucky > 0:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = int(input().strip())
l = list(map(int, input().strip().split()))
unlucky = len([a for a in l if a % 2])
print('READY FOR BATTLE' if n - unlucky > unlucky else 'NOT READY')


n = eval(input())
a = list(map(int, input().split()))
e = o = 0
for i in range(n):
	if a[i] % 2:
		o += 1
	else:
		e += 1
if e > o:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = eval(input())
l = list(map(int, input().split()))
(c1, c2) = (0, 0)
for x in l:
	if x & 1 == 0:
		c1 += 1
	else:
		c2 += 1
if c1 > c2:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


def lucky(a):
	count = 0
	for i in a:
		if i % 2 == 0:
			count += 1
	return count > len(a) - count
N = int(input())
a = list(map(int, input().split()))
if lucky(a):
	print('READY FOR BATTLE')
else:
	print('NOT READY')


T = eval(input())
t = list(map(int, input().strip().split()))
c = 0
for i in t:
	if i % 2 == 0:
		c = c + 1
if c > len(t) - c:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = int(input())
a = [int(i) for i in input().split() if int(i) % 2 == 0]
print('READY FOR BATTLE' if len(a) > n / 2 else 'NOT READY')


n = eval(input())
arr = list(map(int, input().split()))
ce = 0
co = 0
for i in arr:
	if i % 2 == 0:
		ce += 1
	else:
		co += 1
if ce > co:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = eval(input())
l = [int(x) & 1 for x in input().split()]
if sum(l) < len(l) - sum(l):
	print('READY FOR BATTLE')
else:
	print('NOT READY')


import sys
n = eval(input())

def even(a):
	a = int(a)
	if a % 2 == 0:
		return 1
	return 0
a = list(map(even, sys.stdin.readline().split()))
if a.count(1) > len(a) / 2:
	print('READY FOR BATTLE')
else:
	print('NOT READY')


n = eval(input())
a = list(map(int, input().split()))
l = 0
for i in a:
	if i % 2 == 0:
		l += 1
if l > n - l:
	print('READY FOR BATTLE')
else:
	print('NOT READY')