单点时限: 1.0 sec
内存限制: 512 MB
This quesiton is very simple.This quesiton is very simple.This quesiton is very simple.
Alice and Bob play a game. Initially they have $n$ cards. They take alternating turns, and Alice is moving first.
During each turn, the player will choose a certain card and get points. If Alice chooses the $i$-th card, her score will be increased by $a_i$. If Bob chooses the $i$-th card,his score will be increased by $b_i$. Each card can only be choosed by one player. The game ends when all cards are choosed.
Whoever gets a higher score, wins. You have to determine who wins if they both play optimally.
There are multiple test cases in this problem.
In each test case,the first line contains one integer $n(1\leq n\leq 10^5)$. The second line contains $n$ space-separated positive integers $a_i(1\leq a_i\leq 10^9)$. The third line contains $n$ space-separated positive integers $b_i(1\leq b_i\leq 10^9)$.
For each test case print Alice if Alice can win and Bob if Bob can win.
If they get the same score,print AEMSHANA.
3 1 2 3 4 5 6 2 1 8 9 1 2 3 5 4 1
Bob AEMSHANA Alice