using namespace std;
#include <bits/stdc++.h>
typedef long long ll;


char solve(ll n, ll k, vector<ll>& fib);

int main() {

    // Read in stuff.
    ll n, k;
    cin >> n >> k;
    k--;

    vector<ll> fib;
    fib.push_back(0);
    fib.push_back(1);
    while (true) {
        int n = fib.size();
        ll next = fib[n-1]+fib[n-2];
        if (next > 3e18+1) break;
        fib.push_back(next);
    }

    // This is a query with the same answer. s(n) starts with s(n-2), s(n-4), etc.
    if (n > fib.size()) {
        if (n%2 == (fib.size()-1)%2 )
            n = fib.size()-1;
        else
            n = fib.size()-2;
    }

    cout << solve(n, k, fib);


    return 0;
}

char solve(ll n, ll k, vector<ll>& fib) {

    if (n==1) return 'N';
    if (n==2) return 'A';

    if (k < fib[n-2])  return solve(n-2, k, fib);
    else                return solve(n-1, k-fib[n-2], fib);
}