Alice and Bob are playing a game with $n$ piles of stones. It is guaranteed that $n$ is an even number. The $i$-th pile has $a_i$ stones.

Alice and Bob will play a game alternating turns with Alice going first.

On a player's turn, they must choose exactly $\frac{n}{2}$ nonempty piles and independently remove a positive number of stones from each of the chosen piles. They can remove a different number of stones from the piles in a single turn. The first player unable to make a move loses (when there are less than $\frac{n}{2}$ nonempty piles).

Given the starting configuration, determine who will win the game.


-----Input-----

The first line contains one integer $n$ ($2 \leq n \leq 50$) — the number of piles. It is guaranteed that $n$ is an even number.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \leq a_i \leq 50$) — the number of stones in the piles.


-----Output-----

Print a single string "Alice" if Alice wins; otherwise, print "Bob" (without double quotes).


-----Examples-----
Input
2
8 8

Output
Bob

Input
4
3 1 4 1

Output
Alice



-----Note-----

In the first example, each player can only remove stones from one pile ($\frac{2}{2}=1$). Alice loses, since Bob can copy whatever Alice does on the other pile, so Alice will run out of moves first.

In the second example, Alice can remove $2$ stones from the first pile and $3$ stones from the third pile on her first move to guarantee a win.

Difficulty: interview

Starter code:

Solutions:
n=int(input())
s=list(map(int,input().split()))
print("Bob"if s.count(min(s))>n/2 else"Alice")


def judge(i):
    return "Bob" if cnt[i]>n//2 else "Alice"
n=int(input())
a=list(map(int,input().split()))
cnt=[0 for i in range(51)]
for i in a:
    cnt[i]+=1
print(judge(min(a)))

n = int(input())
a = [int(i) for i in input().split()]
print("Alice" if sum([1 if i==min(a) else 0 for i in a ]) <= n/2 else "Bob")

n=int(input())
d=[0]*51
for i in input().split(" "):
    d[int(i)]+=1
for i in range(50):
    if (d[i]>n/2):
        print("Bob")
        break
    else:
        if (d[i]>0):
            print("Alice")
            break

n = int(input())
a = list(map(int,input().split()))
print( 'Alice' if a.count(min(a)) <= n//2 else 'Bob' )
##


n = int(input())
a = [int(x) for x in input().split()]
imin = a[0]
cnt = 0
for x in a:
	if x < imin:
		imin = x
		cnt = 0
	if x == imin:
		cnt += 1
if cnt <= n // 2:
	print("Alice")
else:
	print("Bob")


n = int(input())
pilhas = list(map(int, input().split()))

count = [0] * 51

for pilha in pilhas:
    count[pilha] += 1

for i in range(51):
    if count[i] != 0 and count[i] * 2 <= n:
        print("Alice")
        break
    elif count[i] != 0 and count[i] * 2 > n:
        print("Bob")
        break

n = int(input())

jog = [int(i) for i in input().split()]
mi = min(jog)

qtd = 0
for i in range(len(jog)):
    if(jog[i] == mi):
        qtd+=1
if(qtd <= n//2 and qtd!=0):
    print("Alice")
else:
    print("Bob")


n = int(input())
a = [int(_) for _ in input().split()]

cnt = [0 for i in range(max(a) + 1)]
for i in a:
    cnt[i] += 1

print("Bob" if cnt[min(a)] > (n >> 1) else "Alice")


n = int(input())
a = [int(x) for x in input().split()]
imin = a[0]
cnt = 0
for x in a:
	if x < imin:
		imin = x
		cnt = 0
	if x == imin:
		cnt += 1
if cnt <= n // 2:
	print("Alice")
else:
	print("Bob")


n=int(input())
piles = list(map(int,input().split()))
if(piles.count(min(piles))>n/2):
    print("Bob")
else:
    print("Alice")


n = int(input())

arr = [int(x) for x in input().split()]

arr.sort()

x = 1

while True:
    if arr.count(x) > n//2:
        print('Bob')
        break
    elif x in arr:
        print('Alice')
        break
    else:
        x += 1

    


n = int(input())
a = [int(x) for x in input().split()]
mn, cnt = min(a), 0
for i in a: 
    if i == mn: cnt += 1
print("Alice" if cnt <= int(n / 2) else "Bob")