#include <vector>
#include <algorithm>
#include <fstream>
#include<string>
#include <iostream>
#include <map>
# include <set>
#include<cmath>
#include <numeric>
using namespace std;

long long int const q = 1e15;
vector<char> r;

const long long mod = 998244353;

long long  int gcd(long long int a,long long int b)
{
    if (b == 0) return a;
    a %= b;
    return gcd(b, a);
}

int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int num1 = 0;
    int num2 = 0;
    for (int i = 0; i < s.size(); i++) {
        if (s[i] == 'T') num1++;
        if (s[i] == 'U') num2++;

    }
    if (num1 == 0 && num2 == 0) cout << "BOTH";
    else if (num1 == 0) cout << "RNA";
    else if (num2 == 0) cout << "DNA";
    else cout << "NONE";
    cin >> num1;
}