
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <tuple>

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();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//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 MT make_tuple
#define SZ(a) int((a).size())
#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,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};

//other
//--------------------------------------------
#define RANGE(a, c, b) ((a <= b) && (b < c))

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int solve(string snake){
	if(snake[0] != '>') return 0;
	if(snake[1] == '\''){
		int i = 2;
		while(snake[i] == '='){
			i++;
		}
		if(snake[i] != '#') return 0;
		int length = i - 2;
		i++;
		while(snake[i] == '='){
			i++;
		}
		int length2 = i -3 - length;
		if(length2 != length) return 0;
		if(length > 0 &&
			snake[i] == '~' && 
			i == snake.length() - 1){
			return 1;
		}
	}else if(snake[1] == '^'){
		int i = 2;
		int length = 0;
		while(snake[i] =='Q' &&
			snake[i + 1] == '='){
			i += 2;
			length++;
		}
		if(length > 0 &&
			snake[i] == '~' &&
			snake[i + 1] == '~' &&
			i + 1 == snake.length() - 1){
			return 2;
		}
	}
	return 0;
}

int main(int argc, char const *argv[])
{
	int n;
	cin >> n;
	REP(i, n){
		string snake;
		cin >> snake;
		string ans;
		switch(solve(snake)){
			case 0:
			ans = "NA";
			break;

			case 1:
			ans = "A";
			break;

			case 2:
			ans = "B";
			break;
		}
		cout << ans << endl;
	}
	
	return 0;
}