{"trustable":false,"sections":[{"title":"Description","value":{"format":"HTML","content":"Adrien and Austin are playing a game with rocks.\n\u003c/br\u003e\nInitially, there are N rocks, indexed from 1 to N. In one move, the player chooses at least 1 and at most K consecutively indexed rocks (all of them should not have been removed) and removes them from the game.\n\u003c/br\u003e\nAdrien always starts the game, and then Adrien and Austin take turns making moves. The player who is unable to make a move (because all rocks are removed) loses.\n\u003c/br\u003e\nGiven N, K, find who is going to win the game (assuming they are smart and are playing optimally)."}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains two integers N, K (0 ≤ N ≤ 10\u003csup\u003e6\u003c/sup\u003e, 1 ≤ K ≤ 10\u003csup\u003e6\u003c/sup\u003e).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"Print a name (\"Adrien\" or \"Austin\", without the quotes) — the person who is going to win the game."}},{"title":"Sample Input1","value":{"format":"HTML","content":"1 1"}},{"title":"Sample Output1","value":{"format":"HTML","content":"Adrien"}},{"title":"Sample Input2","value":{"format":"HTML","content":"9 3"}},{"title":"Sample Output2","value":{"format":"HTML","content":"Adrien"}}]}