#include<cstdio>
#include<algorithm>
using namespace std;
struct Poker {
char num;
char flower;
};
Poker poker[6];
char Flower[4] = {'d', 'c', 'h', 's'};
char Num[13] = {'2', '3', '4', '5', '6', '7',
'8', '9', '10', 'J', 'Q', 'K', 'A'};
int getFlower(char c) {
for (int i = 0 ; i < 4; ++i)
if (Flower[i] == c)
return i;
return -1;
}
int getNum(char c) {
for (int i = 0; i < 13; ++i )
if (Num[i] == c)
return i;
return -1;
}
bool compare(const Poker poker1, const Poker poker2) {
if (getNum(poker1.num) < getNum(poker2.num) )
return true;
if (getNum(poker1.num) == getNum(poker2.num) && getFlower(poker1.flower) < getFlower(poker2.flower))
return true;
return false;
}
int main(void) {
scanf("%c %c %c %c %c %c %c %c %c %c", &poker[0].num, &poker[0].flower
, &poker[1].num, &poker[1].flower, &poker[2].num, &poker[2].flower
, &poker[3].num, &poker[3].flower, &poker[4].num, &poker[4].flower);
// for (int i = 0; i < 5; ++i)
// printf("%c%c, poker[i].num, poker[i].flower);
// printf("\n");
sort(poker, poker + 5, compare);
for (int i = 0; i < 5; ++i)
printf("%c%c, poker[i].num, poker[i].flower);
return 0;
}