#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],p[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!");
	r=n+1;l=0;
	fd(i,n,1)
	{
		if((n-i)&1) p[--r]=b[i];
		else p[++l]=b[i];
	}
	l=0;r=n+1;
	while((s1+a[p[l+1]])*2<s) l++,s1+=a[p[l]];
	while((s2+a[p[r-1]])*2<s) r--,s2+=a[p[r]];
	if((s-s1-s2)*2>=s) return !printf("Internationale!");
	fo(i,1,l) ans[p[i]]='Z';
	fo(i,l+1,r-1) ans[p[i]]='Y';
	fo(i,r,n) ans[p[i]]='B';
	fo(i,1,n) printf("%c",ans[i]);
}