#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;






string consistency(int n){
	
	vector<int> dpA(n);
	vector<int> dpB(n);
	
	dpA[0] = a[0];
	dpB[0] = b[0];
	
	
	for(int i=1; i<n; i++){
		
		dpA[i] = a[i] + dpA[i-1];
		if(i-2>=0) dpA[i] = max(dpA[i] , a[i] + dpB[i-2]);
		
		dpB[i] = b[i] + dpB[i-1];
		if(i-2>=0) dpB[i] = max(dpB[i] , b[i] + dpA[i-2]);
	}
	
	string ans = "";
	int curr = 0; // 0 -> A     , 1 -> B
	
	if(dpA[n-1] > dpB[n-1])	curr = 0;
	else curr = 1;
		
	int i = n-1;
	while(i>=0){
		if(curr == 0){
			ans.push_back('A');
			if(i-1>=0 && dpA[i] != a[i] + dpA[i-1]){
				ans.push_back('T');
				curr = 1;
				i--;
			}
		}
		else{
			ans.push_back('B');
			if(i-1>=0 && dpB[i] != b[i] + dpB[i-1]){
				ans.push_back('T');
				curr = 0;
				i--;
			}
		}
		i--;
	}
	
	reverse(begin(ans), end(ans));
	
	return ans;
}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << consistency(n) << endl;
    
}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}