#include <bits/stdc++.h>   using namespace std;   const int MOD = 998244353;   const int N = 200005;   const double PI = 4 * atan(1);   const long long MAX = 9223372036854775807;   int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};   int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};   long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }   long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }   bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }   bool isprime(long long u) {     for (long long i = 2; i <= (int)sqrt(u); i++) {       if (u % i == 0) return 0;     }     return 1;   }   long long mod(long long to_mod, long long MOD) {     to_mod %= MOD;     while (to_mod < 0) to_mod += MOD;     return to_mod % MOD;   }   long long moduloMultiplication(long long a, long long b, long long mod) {     long long res = 0;     a %= mod;     while (b) {       if (b & 1) res = (res + a) % mod;       a = (2 * a) % mod;       b >>= 1;     }     return res;   }   long long power(long long x, long long y) {     long long res = 1;     x = x;     while (y > 0) {       if (y & 1) res = (res * x);       y = y >> 1;       x = (x * x);     }     return res;   }   long long n, m, x, y, t, k, z, w, l, r, ans;   bool vis[N];   long long a[N];   long long lvl[N];   map<long long, vector<long long> > adj;   map<long long, long long> maa;   void bfs(long long src) {     queue<long long> q;     q.push(src);     lvl[src] = 1;     while (!q.empty()) {       long long ras = q.front();       q.pop();       if (lvl[ras] % 2 == 0) {         vis[ras] = 1;         continue;       }       for (auto t : adj[ras]) {         if (vis[t]) continue;         lvl[t] = lvl[ras] + 1;         q.push(t);       }     }   }   int main() {     ios::sync_with_stdio(0);     cin.tie(NULL);     cin >> n;     for (int i = 0; i < n; i++) {       cin >> a[i];       maa[a[i]] = i;     }     for (int j = 0; j < n; j++) {       k = a[j];       for (int i = j; i < n; i += k) {         if (a[i] > k) adj[i].push_back(j);       }       for (int i = j; i >= 0; i -= k) {         if (a[i] > k) adj[i].push_back(j);       }     }     for (int i = n; i >= 1; i--) {       if (vis[maa[i]]) continue;       bfs(maa[i]);     }     for (int i = 0; i < n; i++) {       if (vis[i])         cout <<  A ;       else         cout <<  B ;     }     return 0;   }   