Adrien and Austin （ 思维 ）

 

 

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <fstream>
#include <iomanip> //cout<<fixed<<setprecision(15)<<xx<<endl;
typedef long long lli;
using namespace std;
multiset<int> mu;
    #define fi      first
    #define se      second
    #define pb      push_back
    #define pql     priority_queue<lli>
    #define pq      priority_queue<int>
    #define ok      return 0;
    #define oi(x)   cout<<x<<endl;
    #define os(str) cout<<string(str)<<endl;
using namespace std;
//multiset<int> :: iterator it ;
//int dir[6][3] = {0,0,1,0,0,-1,1,0,0,-1,0,0,0,1,0,0,-1,0};           //三维六向
//int dir[8][2] = {2,1,2,-1,-2,1,-2,-1,1,2,1,-2,-1,2,-1,-2};          //马走日
//int dir[4][2] = {1,0,-1,0,0,1,0,-1};                                //二维四向
//int dir[8][2]={1,0,1,1,1,-1,-1,0,-1,1,-1,-1,0,1,0,-1};              //全方位
#define en(xx) xx.begin(),xx.end()
#define rep(j,k) for (int i = j;   i < k;  i++)
#define per(j,k) for (int i = j-1; i >= k; i--)
  typedef pair < int, int > pii;
  typedef pair < lli, lli > pll;
  typedef vector < lli > vl;
  typedef vector < int > vi;
#define TLE std::ios::sync_with_stdio(false);   cin.tie(NULL);   cout.tie(NULL);   cout.precision(10);
const int mxn = 2e5 + 10;

int main()
{
    int n,k;
    cin>>n>>k;
    if(!n)
        cout<<"Austin"<<endl;
    else if(k==1)
    {
        if(n&1)
            cout<<"Adrien"<<endl;
        else
            cout<<"Austin"<<endl;
    }
    else
        cout<<"Adrien"<<endl;
}