#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()


struct Edge {
    int to, cost, nm;
    Edge(int to, int cost, int nm): to(to), cost(cost), nm(nm) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

ll GCD(ll a, ll b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

int main() {

    //cout << fixed << setprecision(2);

    int n;
    cin >> n;
    for(int i=0; i<n; ++i){
        string s; cin >> s;
        int n = s.size();

        if(n>2 && s[0] == '>' && s[1] =='\''){

            if(s[n-1] != '~'){
                cout << "NA" << endl;
            }else{
                int l = 2, r = n-2;
                bool ok = true;
                int stmt = 0;
                int cnt1=0, cnt2=0;
                for(int j=l; j<=r; ++j){
                    if(s[j] == '#') stmt++;
                    else if(s[j]=='='){
                        if(stmt == 0) cnt1++;
                        else if(stmt == 1) cnt2++;
                        else ok = false;
                    }else ok = false;
                }
                if(ok){
                    if(cnt1 >= 1 && (cnt1 == cnt2)){
                        cout << "A" << endl;
                    }else{
                        cout << "NA" << endl;
                    }
                }else{
                    cout << "NA" << endl;
                }
            }
        }else if(n > 2 && s[0] == '>' && s[1] == '^'){
            if(s[n-2] == '~' && s[n-1] == '~'){
                if(n%2 == 1){
                    cout << "NA" << endl;
                }else {
                    bool ok = true;
                    int cnt = 0;
                    for (int j = 2; j <= n - 3; j+=2) {
                        if(s[j] == 'Q' && s[j+1] == '='){
                            cnt++;
                        }else{
                            ok = false;
                        }
                    }
                    if(cnt>=1 && ok){
                        cout << "B" << endl;
                    }else{
                        cout << "NA" << endl;
                    }
                }
            }else{
                cout << "NA" << endl;
            }
        }else{
            cout << "NA" << endl;
        }
    }
    return 0;
}


Measured memory_bytes: 3152