# import heapq 
# from heapq import heappop,heappush,heapify
# from sys import stdin, setrecursionlimit
# input = stdin.readline
# readline = stdin.readline

# from collections import deque
# d=deque()

# N,M,K=map(int,input().split())
# A=list(map(int, input().split()))

S=input()
T=input()

ans=[0,0,0,0]
for i in range(2):
  for j in range(2):
    p=S[i]+T[j]
    if 'A' in p and 'B' not in p:
      ans[0]+=25
    elif 'A' not in p and 'B' in p:
      ans[1]+=25
    elif 'A' in p and 'B' in p:
      ans[2]+=25
    else:
      ans[3]+=25
      
print(*ans)