/* Jitu Das

Senior-5

Contest 2

Montgomery Blair HS

9011

*/

#include <stdio.h>

#include <string.h>

#define SUIT(x) (((x)=='D')?0:((x)=='C')?1:((x)=='S')?2:((x)=='H')?3:-1)

//#define CARD(x) (((x)=='A')?0:((x)=='K')?1:((x)=='Q')?2:((x)=='J')?3:((x)=='T')?4:((x)=='N')?5:-1)

#define MIN(x,y) (((x)<(y))?(x):(y))

char *i,in[256],c[4]['Z'];

int main() {

int suit=0, pts=0;

memset(c,0,4*'Z');

scanf("%s",in);

char t = SUIT(in[0]);

for (i=in+2;*i;i++) {

if (*i==',') suit++;

else c[suit][*i]++;

}

if (c[0]['J']>0 && c[2]['Q']>0) pts += 4; // 10

if (c[0]['J']>1 && c[2]['Q']>1) pts += 34; // 3

if (c[0]['A']>0 && c[1]['A']>0 && c[2]['A']>0 && c[3]['A']>0) pts += 10; // 4

if (c[0]['K']>0 && c[1]['K']>0 && c[2]['K']>0 && c[3]['K']>0) pts += 8; // 5

if (c[0]['Q']>0 && c[1]['Q']>0 && c[2]['Q']>0 && c[3]['Q']>0) pts += 6; // 11

if (c[0]['J']>0 && c[1]['J']>0 && c[2]['J']>0 && c[3]['J']>0) pts += 4; // 12

if (c[0]['A']>1 && c[1]['A']>1 && c[2]['A']>1 && c[3]['A']>1) pts += 110; // 6

if (c[0]['K']>1 && c[1]['K']>1 && c[2]['K']>1 && c[3]['K']>1) pts += 88; // 7

if (c[0]['Q']>1 && c[1]['Q']>1 && c[2]['Q']>1 && c[3]['Q']>1) pts += 66; // 13

if (c[0]['J']>1 && c[1]['J']>1 && c[2]['J']>1 && c[3]['J']>1) pts += 44; // 14

if (c[t]['A']>1 && c[t]['K']>1 && c[t]['Q']>1 && c[t]['J']>1 && c[t]['T']>1) pts += 150; // 2

while (c[t]['A']>0 && c[t]['K']>0 && c[t]['Q']>0 && c[t]['J']>0 && c[t]['T']>0) { // 1

pts += 15;

c[t]['A']--;

c[t]['K']--;

c[t]['Q']--;

c[t]['J']--;

c[t]['T']--;

}

for (suit=0;suit<4;suit++) pts += ((suit==t)?4:2)*MIN(c[suit]['K'], c[suit]['Q']); // 8,9

printf("%d\n", pts);

main();

}