#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()


int ABS(int a)
{
	if (a<0) return -a; else return a;
}

int main(void)
{
	long int	kkk=0;
	while (true)
    {
		int A=0;
		int B=0;
		packages.clear();
    	int count;
  		cin >> count;
		if (count==0) break;
		if (kkk>0) cout << "\n";
        kkk++;
		for (int i=0;i<count;i++)
		{
			int p;
			cin >> p;
			//cout << p;
			packages.push_back(p);
		}
//		sort(ALL(packages));
		//for(int i=0;i<count;i++)
		int iii=0;
		fflush(stdout);
		while(!packages.empty())
		{
			int MDA=5000000;
			int MDB=5000000;
			int DA,DB;
			int pi;
			int j;
			//cout<<"smmycka1\n";
			//fflush(stdout);
			for(j=0;j<packages.size();j++)
			{
				int xpkg=packages[j];
				DA=ABS((A+(xpkg))-B);
			    DB=ABS(A-(B+(xpkg)));
				if (DA<=MDA) { MDA=DA; pi=j; }
				if (DB<=MDB) { MDB=DB; pi=j; }
			}
			//cout<<"smmycka2\n";
			//fflush(stdout);
			int pk =packages[pi];
			cout<<pk;
			cout<<"-";
			if (DA<DB) 
			{
				cout<<"A";
				A=A+pk;
			}
			else
			{
				cout<<"B";
				B=B+pk;
			}

			packages.erase(packages.begin()+pi);	
			
			if (iii<count-1) cout << " ";
			iii++;
		}
    }

	return 0;	
}