#include <algorithm>
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
using namespace std;

#define SIZE(s) int((s).size())
#define REP(i,n) for (int i=0; i<(n); i++)

int N;
int A[60000];

int main() {
  while (1) {
    scanf("%d",&N);
    if (!N) break;
    REP(i,N) scanf("%d",&A[i]);
    sort(A,A+N);
    printf("%d-A",A[0]);
    for (int i=N-1; i>0; i--) printf(" %d-%c",A[i],(N-1-i)%2?'A':'B');
    printf("\n");
  }
}