#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define ll long long
using namespace std;
const int N=200007;
int n,l,r,b[N];ll a[N],s,s1,s2;char ans[N];
bool cmp(int x,int y){return a[x]<a[y];}
int main()
{
	scanf("%d",&n);
	fo(i,1,n) scanf("%lld",&a[i]),s+=a[i],b[i]=i;
	sort(b+1,b+n+1,cmp);
	if(a[b[n]]*2>=s) return !printf("Internationale!");
	for(int i=1;i<n-i;++i) swap(b[i],b[n-i]);
	l=0;r=n+1;
	while((s1+a[b[l+1]])*2<s) l++,s1+=a[b[l]];
	while((s2+a[b[r-1]])*2<s) r--,s2+=a[b[r]];
	fo(i,1,l) ans[b[i]]='Z';
	fo(i,l+1,r-1) ans[b[i]]='Y';
	fo(i,r,n) ans[b[i]]='B';
	fo(i,1,n) printf("%c",ans[i]);
}