#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<iostream>

 #include<cctype>

 #include<set>

 #include<vector>

 #include<queue>

 #include<map>

 #define fi(s) freopen(s,"r",stdin);

 #define fo(s) freopen(s,"w",stdout);

 using namespace std;

 typedef long long LL;

 inline int read() {

     int x=,f=;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-;

     for(;isdigit(ch);ch=getchar())x=x*+ch-'';return x*f;

 }

 const int N = ;

 int a[N], deg[N], q[N], f[N];

 vector<int>T[N];

 int main() {

     int n = read();

     for (int i=; i<=n; ++i) a[i] = read();

     for (int i=; i<=n; ++i) {

         for (int j=i+a[i]; j<=n; j+=a[i])

             if (a[j] > a[i]) T[j].push_back(i), deg[i] ++;

         for (int j=i-a[i]; j>=; j-=a[i])

             if (a[j] > a[i]) T[j].push_back(i), deg[i] ++;

     }

     int L = , R = ;

     memset(f, -, sizeof(f));

     for (int i=; i<=n; ++i)

         if (!deg[i]) q[++R] = i, f[i] = ;

     while (L <= R) {

         int u = q[L ++];

         for (int sz=T[u].size(),i=; i<sz; ++i) {

             int v = T[u][i];

             if (f[v] == -) {

                 if (f[u] == ) f[v] = ;

                 else f[v] = ;

             }

             else {

                 if (f[u] == ) f[v] = ;

             }

             deg[v] --;

             if (!deg[v]) q[++R] = v;

         }

     }

     for (int i=; i<=n; ++i) {

         if (f[i]) putchar('A');

         else putchar('B');

     }

     return ;

 }