rt

#include<bits/stdc++.h>
using namespace std;
const int maxn=411;
int arr[30];
int Max=1;
char Map[maxn][30];
string word;
void SUM() {
	int x;
	for (int i = 0; word[i] != 0; ++i) {
		x = word[i] - 64;
		if (x >= 1 && x <= 26) {
			++arr[x];
			if (Max < arr[x]) {
				Max = arr[x];
			}
		}
	}
}
void Print() {
	int Cnt;
	for (int j = 1; j <= 26; ++j) {
		int cnt = 1;
		for (int i = Max; cnt <= arr[j]; --i) {
			Map[i][j]='*';
			++cnt;
		}
	}
	for (int i = 1; i <= Max; ++i) {
		for (int j = 1; j <= 26; ++j) {
			if (j == 1 && Map[i][j] == '*') {
				printf("%c ",Map[i][j]);
				++j;
				Cnt=j;
			}
			while (1) {
				if(Map[i][Cnt]!='*') ++Cnt;
				if(Cnt==26) break;
				if(Map[i][Cnt]=='*') break;
			}
			if(Cnt==26) break;
			if (Map[i][j] == '*') {
				printf("%c ",Map[i][j]);
			}
			if (j != 26 && Map[i][j] != '*') {
				printf("  ");
			}
		}
		printf("\n");
	}
}
int main() {
	for (int i = 1; i <= 4; ++i) {
		getline(cin,word);
		SUM();
	}
	Print();
	printf("A B C D E F G H I J K L M N O P Q R S T U V W X Y Z");
	return 0;
}
/*
                            *
                            *
        *                   *
        *                   *     *   *
        *                   *     *   *
*       *     *             *     *   *
*       *     * *     * *   *     * * *
*       *   * * *     * *   * *   * * * *
*     * * * * * *     * * * * *   * * * *     * *
* * * * * * * * * * * * * * * * * * * * * * * * * *
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
*/