H. A Simple Game - 2021 年东华大学金马程序设计联赛

仪表盘所有提交榜单题解

你可以在这里下载。

单点时限: 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.

样例

Input

Output

Bob
AEMSHANA
Alice

NaN

A. Smart AEMShana！ B. Genshin Impact C. Back D. Move the numbers E. A Similar Game F. It is Quite Big G. IDEA's Tree H. A Simple Game I. A Small Game J. A Special Game K. AEMShana loves games！

比赛状态发生变化，点 OK 刷新。

OK

2021 年东华大学金马程序设计联赛

输入格式

输出格式

样例

题目列表

服务

开源

关于我们