#Author: Tina Lekse

#Gimnazija Vic

#Intermediate 3

#Python version: 2.7

suits={'D':60, 'C':20,'S':40, 'H':0}

d={"A":1, "2":2, "3":3, "4":4, "5":5, "6":6, "7":7, "8":8, "9":9, "T":10, "J":11, "Q":12, "K":13}

#list: '4', H, value+suite, face value, set/run value

def poop(h):

for i in range(len(h)):

h[i]=[h[i][0], h[i][1], d[h[i][0]] + suits[h[i][1]], d[h[i][0]], 0]

if h[i][-2]>10:

h[i][-2]=10

return h

s=poop(raw_input().split(', '))

sets=[]

runs=[]

#getting sets

mark=[0 for i in range(7)]

used=[]

n=1

#mark sets (max = 3 different)

for i in range(7):

for j in range(7):

if s[i][0]==s[j][0] and s[i][0] not in used:

s[j][4]=n

n+=1

used.append(s[i][0])

used=[]

for i in range(7):

t=sorted([s[j] for j in range(7) if s[j][4]==s[i][4]])

if len(t)>=3 and t not in used:

sets.append(t)

used.append(t)

#getting runs

s.sort(key=lambda r:r[2])

for i in range(7):

s[i][4]=0

for i in range(3,7):

if (s[i-3][2]+3 == s[i-2][2]+2) and (s[i-2][2]+2 == s[i-1][2]+1) and (s[i-1][2]+1 == s[i][2]):

s[i][4]=i-1

s[i-1][4]=i-1

s[i-2][4]=i-1

s[i-3][4]=i-1

for i in range(2,7):

if (s[i-2][2]+2 == s[i-1][2]+1) and (s[i-1][2]+1 == s[i][2]) and (s[i][4]==0):

s[i][4]=i-1

s[i-1][4]=i-1

s[i-2][4]=i-1

for i in range(7):

t=[j for j in s if j[4]==s[i][4] and j[4]!=0]

if t not in used and len(t)>=3:

runs.append(t)

used.append(t)

b=True

for j in range(len(sets)):

if b==False:

break

for i in range(len(sets[j])):

if b==False:

break

for k in range(len(runs)):

if sets[j][i] in runs[k]:

if len(runs[k])<len(sets[j]):

sets[j].remove(sets[j][i])

else:

runs[k].remove(sets[j][i])

b=False

break

#hard copy of list

def unshared_copy(inList):

if isinstance(inList, list):

return list( map(unshared_copy, inList) )

return inList

#getting inputs:

for k in range(5):

truns=unshared_copy(runs)

tsets=unshared_copy(sets)

s=poop(raw_input().split(', '))

i=0

while i<len(s):

for j in range(len(tsets)):

if len(tsets[j])<4 and s[i] not in tsets[j] and tsets[j][0][0]==s[i][0]:

tsets[j].append(s[i])

s.pop(i)

i=-1

break

else:

for j in range(len(truns)):

if s[i][2]==truns[j][0][2]-1:

truns[j]=[s[i]]+truns[j]

s.pop(i)

i=-1

break

elif s[i][2]==truns[j][-1][2]+1:

truns[j].append(s[i])

s.pop(i)

i=-1

break

i+=1

print "%d"%(sum(i[3] for i in s))