#include <vector>
#include <string>
#include <iostream>
#include <algorithm>

using namespace std;

vector<int> packages;

//#define FOREACH(it,c) for(__typeof((c).begin())it=(c).begin();(it)!=(c).end();(it)++)
#define ALL(c) (c).begin(),(c).end()

#define LL long long int

/*
LL ABS(LL a)
{
	if (a<0) return -a; else return a;
}
*/

int main(void)
{
	bool first=true;
	while (true)
    {
		LL A=0LL;
		LL B=0LL;

		packages.clear();

    	int count;
  		cin >> count;
		if (count==0) break;

		if (first) { first=false; } else { cout << "\n"; }
    
		for (int i=0;i<count;i++)
		{
			int p;
			cin >> p;
			packages.push_back(p);
		}

		sort(ALL(packages));

		for (int i=0;i<count;i++)
		{
			LL P=packages[i];

			if (A<B)
			{
				A=A+P;
				cout << P << "-A";
			}
			else
			{	
				B=B+P;
				cout << P << "-B";
			}

			if (i<count-1) cout << " ";			
		}
    }

	return 0;	
}