Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	scanner.Scan()
	n, _ := strconv.Atoi(scanner.Text())
	for i := 0; i < n; i++ {
		ans := "NA"
		scanner.Scan()
		s := scanner.Text()
		if s[:2]==">'" && s[len(s)-1:] == "~" {
			tmp := s[2:len(s)-1]
			t := strings.Split(tmp, "#")
			if len(t) == 2 && len(t[0]) > 0 {
				valid := true
				for _, v := range t[0] {
					if string(v) != "=" {
						valid = false
						break
					}
				}
				if valid && t[0] == t[1] {
					ans = "A"
				}
			}
		} else if s[:2] == ">^" && s[len(s)-2:] == "~~" {
			t := s[2:len(s)-2]
			if len(t) > 0 && len(t)%2 == 0 {
				valid := true
				for i := 0; i < len(t); i += 2 {
					if t[i:i+2] != "Q=" {
						valid = false
						break
					}
				}
				if valid {
					ans = "B"
				}
			}
 		}
		fmt.Println(ans)
	}
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int main() {
	int n=in();
	string snake;
	while(n--){
		cin>>snake;
		int i;
		bool a=true,b=true;
		if(snake.size()<6||snake.size()%2!=0){
			a=false;
			b=false;
		}
		for(i=0;i<snake.size();i++){
			if(i==0){
				if(snake[i]!='>'){
					a=false;
					b=false;
				}
			}
			if(i==1){
				if(snake[i]!='\'')a=false;
				if(snake[i]!='^')b=false;
			}
			if(i*2==snake.size()){
				if(snake[i]!='#')a=false;
			}
			if(i==snake.size()-1){
				if(snake[i]!='~'){
					a=false;
					b=false;
				}
			}
			if(i==snake.size()-2){
				if(snake[i]!='~')b=false;
			}
			if(i!=0&&i!=1&&i*2!=snake.size()&&i!=snake.size()-1){
				if(snake[i]!='=')a=false;
			}
			if(i%2==0&&i!=0&&i!=snake.size()-2){
				if(snake[i]!='Q')b=false;
			}
			if(i%2==1&&i!=1&&i!=snake.size()-1){
				if(snake[i]!='=')b=false;
			}
		}
		if(a){
			cout<<"A\n";
		}else if(b){
			cout<<"B\n";
		}else{
			cout<<"NA\n";
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)
#define all(a) (a).begin(), (a).end()

const double eps = 1e-10;
const double pi  = acos(-1.0);
const double inf = (int)1e8;

int main(){
	int n; cin >> n;
	rep(q, n){
		string s; cin >> s;
		bool p = true;
		if(s.substr(0, 2) == ">'"){
			s = s.substr(2);
			int c = 0;
			for(int i=0; i < s.size(); i++) if(s[i] == '='){c++;} else break;
			if(s[c] != '#')p = false;
			s = s.substr(c+1);
			if(c+1 != s.size() || s[s.size()-1] != '~')p = false;
			rep(i, c) if(s[i] != '=')p = false;
			cout << (p ? "A" : "NA") << endl;
		}else if(s.substr(0, 2) == ">^"){
			s = s.substr(2);
			while(s.substr(0, 2) == "Q=") s = s.substr(2);
			cout << (s == "~~" ? "B" : "NA") << endl;
		}else {
			cout << "NA" << endl;
		}
	}
}

C++: #ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

// >'======#======~
bool is_pattern_A(string s){
  ll L = s.size();
  // check tail
  if(s.back()!='~') return false;
  string body = s.substr(2, L-3);
  if(body.size()%2==0) return false;
  ll c = body.size()/2;
  if(body[c]!='#') return false;
  map<char, ll> mp;
  for(char c : body){
    mp[c]++;
  }
  if(mp['=']>0 && mp['=']==body.size()-1 && mp['#']==1){
    return true;
  }else{
    return false;
  }
}

bool is_pattern_B(string s){
  ll L = s.size();
  string tail = s.substr(L-2);
  if(tail!="~~") return false;
  string body = s.substr(2, L-4);
  if(body.size()==0) return false;
  if(body.size()%2==1) return false;
  for(int i=0; i<body.size(); i+=2){
    if(body[i]=='Q' && body[i+1]=='='){
      // ok
    }else{
      return false;
    }
  }
  return true;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N; 
    cin >> N;

    rep(i, N){
      string s;cin>>s;
      if(s.size()==1){
        p("NA");
        continue;
      }
      string head = s.substr(0, 2);
      if(head==">'"){
        if(is_pattern_A(s)){
          p("A");
        }else{
          p("NA");
        }
      }
      else if(head==">^"){
        if(is_pattern_B(s)){
          p("B");
        }else{
          p("NA");
        }
      }
      else{
        p("NA");
      }
    }

    
    return 0;
}