#include<bits/stdc++.h>
using namespace std;
char arr[20];
char arr2[20];
int arr2s[20];int n;int s=n-1;
void dfs(int now){
	if(now<0||s<0){
		return;
	}

	while(arr2s[now]!=3){
		if(arr2[now]==arr[s]){
			cout<<arr2[now]<<' '<<(char)('A'+arr2s[now])<<' '<<(char)('A'+3)<<endl;
			arr2s[now]=3;
			s--;
			dfs(now-1);
		}else{
			cout<<arr2[now]<<' '<<(char)('A'+arr2s[now])<<' '<<(char)('A'+arr2s[now]+1)<<endl;
			arr2s[now]+=1;
			dfs(now-1);
		}
	}
	return ;
}
int main(){
	
	cin>>n;s=n-1;
	for(char i='a';i<n+'a';i++){
		arr2[i-'a']=i;
	}
	cin>>arr;
	dfs(n-1);
	return 0;
}