Problem:
 Score : 100 points    Problem Statement You will be given a string S of length 3 representing the weather forecast for three days in the past.  The i -th character (1 \leq i \leq 3) of S represents the forecast for the i -th day. S , C , and R stand for sunny, cloudy, and rainy, respectively.  You will also be given a string T of length 3 representing the actual weather on those three days.  The i -th character (1 \leq i \leq 3) of S represents the actual weather on the i -th day. S , C , and R stand for sunny, cloudy, and rainy, respectively.  Print the number of days for which the forecast was correct.      Constraints  S and T are strings of length 3 each.  S and T consist of S , C , and R .         Input Input is given from Standard Input in the following format:  S  T       Output Print the number of days for which the forecast was correct.        Sample Input 1 CSS
CSR      Sample Output 1 2   For the first day, it was forecast to be cloudy, and it was indeed cloudy.  For the second day, it was forecast to be sunny, and it was indeed sunny.  For the third day, it was forecast to be sunny, but it was rainy.   Thus, the forecast was correct for two days in this case.       Sample Input 2 SSR
SSR      Sample Output 2 3       Sample Input 3 RRR
SSS      Sample Output 3 0

Solution (Python):
A = str(input())
P = str(input())
cnt = 0
for i in range(3):
    if A[i] == P[i]:
        cnt += 1
print(cnt)

Solution (Python):
s = input()
t = input()

ans = 0
for i in range(3):
  if s[i] == t[i]:
    ans += 1
    
print(ans)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i] == t[i]:
    ans += 1
print(ans)

Solution (Python):
s=input()
t=input()

cnt=0
for i in range(len(s)):
    if s[i]==t[i]:
        cnt+=1
print(cnt)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i] == t[i]:
    ans += 1
print(ans)

Solution (Python):
s = input()
t = input()
cnt = 0
for i in range(3):
    cnt += s[i] == t[i]

print(cnt)

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()


S,T = S(),S()
print(sum(S[i] == T[i] for i in range(3)))

Solution (Python):
s = input()
t = input()

cnt = 0

for i in range(len(s)):
    if s[i] == t[i]:
        cnt += 1

print(cnt)

Solution (Python):
n = input()

n1 = input()

ind = 0
c = 0
for i in n1:
    if i == n[ind]:
        c += 1
    ind += 1

print(c)

Solution (Python):


S =input()
T =input()

cnt = 0

for i in range(3):
    if S[i] == T[i]:
        cnt += 1

print(cnt)

Solution (Python):
s = str(input())
t = str(input())
cnt = 0
for i in range(len(s)):
    if s[i] == t[i]:
        cnt += 1
print(cnt)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Solution (Python):
S = list(input())
T = list(input())
c = 0
for i in range(3):
    if S[i] == T[i]:
        c += 1
print(c)

Solution (Python):
S = str(input())
T = str(input())

ans = 0
for i in range(3):
  if S[i] == T[i]:
    ans += 1
print(ans)

Solution (Python):
s = input()
t = input()
ans = 0

for i in range(3):
  ans += s[i] == t[i]

print(ans)

Solution (Python):
S=input()
T=input()

X=0
for i in range(3):
    X+=S[i]==T[i]
print(X)

Solution (Python):
s = list(input())
t = list(input())
count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        count += 1

print(count)

Solution (Python):
S=input()
T=input()
ans=0
for i in range(3):
    if S[i]==T[i]:
        ans+=1
print(ans)

Solution (Python):
s = input()
t = input()

ans = 0
for i in range(3):
    ans += s[i] == t[i]
print(ans)

Solution (Python):
S, T = [input() for _ in range(2)]
count = 0
for i in range(3):
    if S[i] == T[i]:
        count += 1

print(count)

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
    if s[i]==t[i]:ans+=1
print(ans)

Solution (Python):
s = input()
t = input()

count = 0

for i in range(3):
    if s[i] == t[i]:
        count+= 1

print(count)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
	if s[i] == t[i]:
		ans += 1
print(ans)

Solution (Python):
s = input()
t = input()
res = 0
for i in range(3):
  if s[i] == t[i]:
    res += 1
print(res)

Solution (Python):
s=input()
t=input()
cnt=0
for i,t in zip(s,t):
    if i==t:
        cnt+=1
print(cnt)

Solution (Python):
S = input()
T = input()

res = 0
for i in range(3):
    if S[i] == T[i]:
        res += 1

print(res)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(len(s)):
    if s[i] == t[i]:
        ans += 1
print(ans)

Solution (Python):
s=input()
t=input()
print(sum([s[i]==t[i] for i in range(3)]))

Solution (Python):
forecast_list = list(input())
happened_list = list(input())

hit_count = 0

for f, h in zip(forecast_list, happened_list):
    if f == h:
        hit_count += 1

print(hit_count)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
  if (s[i] == t[i]):
    ans = ans + 1
print(ans)

Solution (Python):
S = input()
T = input()

ans = 0
if S[0] == T[0]: ans += 1
if S[1] == T[1]: ans += 1
if S[2] == T[2]: ans += 1
  
print(ans)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
  if S[i] == T[i]:
    ans +=1
print(ans)

Solution (Python):
s=str(input())
t=str(input())
cnt=0

for i in range(3):
  if s[i]==t[i]:
    cnt+=1
    
print(cnt)

Solution (Python):
print(sum([1 for x, y in zip(input(), input()) if x == y]))

Solution (Python):
f=list(input())
a=list(input())
g=0
if f[0]==a[0]:
    g+=1
if f[1]==a[1]:
    g+=1
if f[2]==a[2]:
    g+=1
print(g)

Solution (Python):
S = input()
T = input()
cnt = 0
for s, t in zip(S, T):
    cnt += s == t
print(cnt)

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
  if s[i]==t[i]:
    ans+=1
print(ans)

Solution (Python):
s = str(input())
t = str(input())
ans = 0
for i in range(len(s)):
    if s[i]==t[i]:
        ans += 1
print(ans)

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
    if s[i]==t[i]:
        ans+=1
print(ans)

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
    if s[i]==t[i]:ans+=1
print(ans)

Solution (Python):
S = list(input())
T = list(input())
res = 0
for i in range(len(S)):
  if S[i] == T[i]:
    res += 1
print(res)

Solution (Python):
S = input()
T = input()
cnt = 0

if S[0] == T[0]:
  cnt += 1
if S[1] == T[1]:
  cnt += 1
if S[2] == T[2]:
  cnt += 1

print(cnt)

Solution (Python):

s = input()
t = input()
ans = 0
if s[0]==t[0]:
    ans+=1
if s[1]==t[1]:
    ans+=1
if s[2]==t[2]:
    ans+=1
print(ans)

Solution (Python):
S = list(input())
T = list(input())
ans = 0
for i in range(3):
    if S[i]==T[i]:
        ans += 1
print(ans)

Solution (Python):
s=input()
t=input()
cnt=0
for i in range(3):
  if s[i]==t[i]: cnt+=1
print(cnt)

Solution (Python):
S = input()
T = input()

cnt = 0
for i in range(3):
    if S[i] == T[i]:
        cnt += 1

print(cnt)

Solution (Python):
S = input()
T = input()
count = 0

for i in range(3):
    if S[i] == T[i]:
        count += 1

print(count)

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
    if s[i]==t[i]:
        ans+=1
print(ans)

Solution (Python):
s = input()
t = input()

ans = 0
for i,j in zip(s,t):
    if i == j:
        ans += 1
        
print(ans)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
  if S[i] == T[i]:
    ans += 1
print(ans)

Solution (Python):
S = str(input())
T = str(input())

Ans = 0
for i in range(0, len(S)):
  if S[i] == T[i]:
    Ans += 1

print(Ans)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Solution (Python):
S = input()
T = input()
ans =0
for i in range(3):
    if S[i]==T[i]:
        ans +=1
print(ans)

Solution (Python):
s = list(input())
t = list(input())
ans = 0
for i in range(3) :
  if s[i] == t[i] :
    ans += 1
print(ans)

Solution (Python):
a = input()
b = input()
c = 0
for i in range(len(a)):
  if a[i] == b[i]:
    c += 1
print(c)

Solution (Python):
S = input()
T = input()

count = 0
for s,t in zip(S,T):
    if s == t:
        count+=1
    
print(count)

Solution (Python):
S = input()
T = input()

cnt, i = 0, 0

for s in S:
    if s == T[i]:
        cnt += 1
    i += 1

print(cnt)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    S = input()
    T = input()

    ans = 0
    for x, y in zip(S, T):
        if x == y:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
a=input()
b=input()
count=0
for i in range(3):
  if a[i]==b[i]:
    count+=1
print(count)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
	if S[i] == T[i]:
		ans += 1
print(ans)

Solution (Python):
S = input()
T = input()

count = 0
for s,t in zip(S,T):
  if s == t:
    count+=1
    
print(count)

Solution (Python):
a = input()
b = input()
c = 0
for i in range(3):
    if a[i] == b[i]:
        c += 1
print(c)

Solution (Python):
s, t, count = input(), input(), 0
for i in range(3):
  if s[i] == t[i]:
    count += 1
print(count)

Solution (Python):
S=input()
T=input()
j=0
for i in range(3):
    if S[i]==T[i]:
        j+=1
print(j)

Solution (Python):
slist = list(input())
tlist = list(input())

slist_new = [slist[0] + '0', slist[1] + '1', slist[2] + '2']
tlist_new = [tlist[0] + '0', tlist[1] + '1', tlist[2] + '2']

list02 = slist_new + tlist_new
andlist = [x for x in list02 if list02.count(x) > 1]

print(len(andlist) // 2)

Solution (Python):
def main():
    s = input()
    t = input()
    ans = 0
    for i in range(3):
        if s[i] == t[i]:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
ans = 0
S = input()
T =input()

for i in range(3):
    if S[i] == T[i]:
        ans += 1

print(ans)

Solution (Python):
s = input()
t = input()

res = 0

for i in range(len(s)):
    if s[i] == t[i]:
        res += 1

print(res)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
  if S[i] == T[i]:
    ans += 1
print(ans)

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


sys.setrecursionlimit(10**7)






S = str(input())
T = str(input())
ans = 0

for i in range(3):
    if(S[i]==T[i]):
        ans+=1


print(ans)

Solution (Python):
f = list(input())
c = list(input())

print(sum(1 for _f, _c in zip(f, c) if _f == _c))

Solution (Python):
S = input()
T = input()

ans = 0
for i in range(len(S)):
    if S[i] == T[i]:
        ans += 1

print(ans)

Solution (Python):
s=input()
t=input()
c=0
for i in range(3):
  if s[i]==t[i]:
    c+=1
print(c)

Solution (Python):
S,T=open(0).read().split()
print(sum([S[i]==T[i] for i in range(3)]))

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
  if s[i]==t[i]:
    ans+=1

print(ans)

Solution (Python):
s=input()
t=input()

count=0
for i in range(3):
    if s[i]==t[i]:
        count+=1
print(count)

Solution (Python):
s=input()
t=input()
count=0
if s[0]==t[0]:
  count=count+1
if s[1]==t[1]:
  count=count+1
if s[2]==t[2]:
  count=count+1
print(count)

Solution (Python):
S = input()
T = input()

ans = 0
for i in [0, 1, 2]:
  if S[i] == T[i]:
    ans = ans + 1
print(ans)

Solution (Python):
c=0
s=input()
t=input()
for i in range(3):
    if s[i]==t[i]:
        c+=1
print(c)

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    S = SS()
    T = SS()

    ans = len([(i, j) for i, j in zip(S, T) if i == j])
    print(ans)

if __name__ == '__main__':
    resolve()

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


s = input()
t = input()
print(sum((s[i]==t[i] for i in range(3))))

Solution (Python):


def main():
    S = input()
    T = input()
    res = 0
    for i in range(3):
        if S[i] == T[i]:
            res += 1
    print(res)

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    S = input()
    T = input()

    ans = 0

    for i in range(3):
        if S[i] == T[i]:
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
S = input()
T = input()
ans = 0
for i,j in zip(S, T):
    if i == j:
        ans += 1

print(ans)

Solution (Python):
S = input()
T = input()
ans = 0
print(len([i for i in range(3) if S[i] == T[i]]))

Solution (Python):
x=list(input())
y=list(input())
z=[x[0]==y[0], x[1]==y[1], x[2]==y[2]]
print(z.count(True))

Solution (Python):
S = str(input())
T = str(input())
count = 0
for i in range(3):
    if S[i]==T[i]:
        count += 1
print(count)

Solution (Python):
def main():
    s = input()
    t = input()
    print(sum(i == j for i, j in zip(s, t)))

main()

Solution (Python):
s = input()
t = input()
cnt = 0
for i in range(3):
  if s[i] == t[i]:
    cnt += 1
print(cnt)

Solution (Python):
s = input()
t = input()

ans = 0
for i in range(3):
    if s[i]  == t[i]:
        ans += 1
print(ans)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(len(s)):
    if s[i]==t[i]:
        ans += 1
print(ans)

Solution (Python):

pred = input()


result = input()


count = 0


for i in range(len(pred)):
    if pred[i] == result[i]:
        count = count + 1


print(count)

Solution (Python):
s = input()
t = input()
cnt = 0

for i in range(3):
  if s[i] == t[i]:
    cnt += 1
    
print(cnt)

Solution (Python):
S = input()
T = input()
cnt2 = 0
for cnt in range(3):
  if S[cnt] == T[cnt]:
    cnt2 += 1

print(cnt2)

Solution (Python):
s = list(input())
t = list(input())
cnt = 0
for i in range(len(s)):
    if s[i] == t[i]:
        cnt += 1
print(cnt)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i] == t[i]:
    ans += 1
print(ans)

Solution (Python):

s = input()
t = input()
ct = 0
for i in range(3):
    if s[i] == t[i]:
        ct += 1
print(ct)

Solution (Python):
S = input()
T = input()
count = 0
for i in range(3):
  if S[i] == T[i]:
    count += 1
print(count)

Solution (Python):
i=list(input())
k=list(input())
sum=0
for j in range(3):
    if i[j]==k[j]:
        sum+=1
print(sum)

Solution (Python):
S = input ()
T = input ()
x = 0
for i in range (3):
  if S[i]==T[i]:
    x += 1
print (x)

Solution (Python):
s1=input()
s2=input()

ans=0
for i, ss1 in enumerate(s1):
  if ss1==s2[i]:
    ans+=1
print(ans)

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
    if s[i] == t[i]:
        ans+=1

print(ans)

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy







mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

al = input()
bl = input()
ans = 0
for i in range(0, 3):
    if(al[i] == bl[i]):
        ans += 1
print(ans)

Solution (Python):
s=list(input())
t=list(input())

cnt=0

for i in range(3):
  if s[i]==t[i]:
    cnt+=1
    

print(cnt)

Solution (Python):
s=input()
t=input()
l1=list(s)
l2=list(t)
c=0
if l1==l2:
  print(3)
else:
  for i in range(len(l1)):
    if l1[i]==l2[i]:
      c+=1
  print(c)

Solution (Python):
a = input()
b = input()
s = 0
for a, b in zip(a, b):
  if a == b:
    s += 1
print(s)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Solution (Python):
s=input()
r=input()
c=0
for i in range(3):
    if(s[i]==r[i]):
        c=c+1
print(c)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Solution (Python):

 

 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools
import copy


 











S = input()
T = input()

ans = 0

for i in range(3):
    if S[i] == T[i]:
        ans += 1

print(ans)

Solution (Python):
S = input()
T = input()

cnt = 0

for i in range(3):
    if S[i] == T[i]:
        cnt += 1

print(cnt)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

s=input()
t=input()
ans=0
for i in range(3):
    if s[i]==t[i]:
        ans+=1
print(ans)

Solution (Python):
a = list(input())
b = list(input())

count = 0
for i in range(len(a)):
  if a[i] == b[i]:
    count += 1
    
print(count)

Solution (Python):
S=input()
T=input()
ct=0
for i in range(3):
  if S[i]==T[i]:
    ct+=1
print(ct)

Solution (Python):
s = input()
t = input()
x = 0
for i in range(3):
    if s[i] == t[i]:
        x += 1
print(int(x))

Solution (Python):
s = input()
t = input()
x = 0
for i in range(3):
    if s[i] == t[i]:
        x += 1
print(x)

Solution (Python):
S = input()
T = input()
Ans = 0
for i in range(len(S)):
    if S[i] == T[i]:
        Ans += 1
print(Ans)

Solution (Python):
S = list(input())
T = list(input())

cnt = 0
for s, t in zip(S, T):
    cnt += s==t
    
print(cnt)

Solution (Python):
S = input()
T = input()

ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Solution (Python):
S = input()
T = input()
count = 0
for i in range(len(S)):
    if S[i] == T[i]:
        count += 1
print(count)

Solution (Python):
s = input()
t = input()
ans = 0
for i, j in zip(s, t):
    if i == j:
        ans+=1
print(ans)

Solution (Python):
s = list(input())
t = list(input())
ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Solution (Python):
from sys import stdin

S = stdin.readline().rstrip()
T = stdin.readline().rstrip()

ans = 0
for s, t in zip(S, T):
    if (s == t):
        ans += 1

print(ans)

Solution (Python):
def main():
    s = input()
    t = input()
    result = 0
    for i in range(0, len(s)):
        if s[i] == t[i]:
            result += 1
    print(result)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
t = input()
c = 0
if s[0] == t[0]:
  c += 1
if s[1] == t[1]:
  c += 1
if s[2] == t[2]:
  c += 1
print(c)

Solution (Python):
S = input()
T = input()

ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(len(S)):
	if S[i] == T[i]:
		ans += 1
print(ans)

Solution (Python):
s=input()
t=input()
c=0
for i in range(len(s)):
  if s[i]==t[i]:
    c+=1
print(c)

Solution (Python):
s=str(input())
t=str(input())
ans=0
for i in range(3):
    if s[i]==t[i]:
        ans+=1
print(ans)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(len(S)):
    if S[i] == T[i]:
        ans += 1 
print(ans)

Solution (Python):
S = list(input())
T = list(input())

cnt = 0
for s, t in zip(S, T):
    if s == t:
        cnt += 1
print(cnt)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(len(S)):
    if S[i] == T[i]: ans += 1
print(ans)

Solution (Python):
s = list(input())
t = list(input())

a = 0

for i in range(len(s)):
    if s[i] == t[i]:
        a += 1

print(a)

Solution (Python):
s = str(input())
t = str(input())
a = 0
for i in range(3):
    if s[i] == t[i]:
        a += 1
print(a)

Solution (Python):
s = input()
t = input()

ans = 0
for i in range(len(s)):
    if s[i] == t[i]:
        ans += 1

print(ans)

Solution (Python):
a = input()
b = input()
A = list(a)
B = list(b)
CNT = 0
for i in range (3):
  if A[i] == B[i]:
    CNT += 1
print(CNT)

Solution (Python):
s = input()
t = input()

result = len(list([True for c1, c2 in zip(s, t) if c1 == c2]))
print(result)

Solution (Python):
a = [input() for i in range(2)]
s = a[0]
t = a[1]
my_result = 0
for i in range(3):
  if s[i] == t[i]:
    my_result += 1
  else:
    my_result += 0
print(my_result)

Solution (Python):
S = input()
T = input()
total = 0
for i in range(3):
  if S[i] == T[i]:
    total += 1
print(total)

Solution (Python):
s = input()
t = input()
print(len([a == b for a, b in zip(s, t) if a == b]))

Solution (Python):
s = input()
t = input()
a = 0
for i in range(len(s)):
    if s[i] == t[i]:
        a += 1
print(a)

Solution (Python):
S = input()
T = input()
res = 0
for i in range(3):
    if S[i] == T[i]:
        res += 1
print(res)

Solution (Python):
S = input()
T = input()
count = 0

for i in range(3):
    if S[i] == T[i]:
        count += 1

print(count)

Solution (Python):
S = input()
T = input()

count = 0
for i in range(3):
    if(S[i] == T[i]):
        count += 1
print(count)

Solution (Python):
s = input()
t = input()
cnt = 0
for i in range(len(s)):
    if s[i] == t[i]:
        cnt = cnt+1

print(cnt)

Solution (Python):
a=input()
b=input()
count=0
for i in range(3):
    if a[i]==b[i]:
        count+=1
print(count)

Solution (Python):
s = input()
t = input()
print(sum([
    1 if s[0] == t[0] else 0,
    1 if s[1] == t[1] else 0,
    1 if s[2] == t[2] else 0
]))

Solution (Python):
s=str(input())
s1=str(input())
e=0
for i in range(0,len(s)):
    if(s[i]==s1[i]):
        e=e+1
print(e)

Solution (Python):
s=input()
t=input()
ans=0
for i in range(3):
    if s[i]==t[i]:
        ans+=1
print(ans)

Solution (Python):
s = str(input())
t = str(input())
num = 0
for i in range(3):
    if s[i] == t[i]:
        num += 1
print(num)

Solution (Python):


s=input()
t=input()
ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans = ans + 1;
print(ans);

Solution (Python):
S=input()
T=input()
count=0
for i in range(3):
    if S[i]==T[i]:
        count=count+1
    else:
        pass
print(count)

Solution (Python):
s = list(input())
t = list(input())

ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1

print(ans)

Solution (Python):
print(3-sum(i!=j for i,j in zip(*open(0))))

Solution (Python):
print(3-sum(i!=j for i,j in zip(*open(0))))

Solution (Python):
s=input()
t=input()
print(sum(1 for i in range(3) if s[i]==t[i]))

Solution (Python):
S = input()
T = input()
cnt = 0
for i in range(3):
    if S[i] == T[i]:
        cnt += 1
print(cnt)

Solution (Python):






s = input()
t = input()

ans = 0

for i in range(3):
    if s[i] == t[i]:
        ans+=1
print(ans)

Solution (Python):
s = input()
t = input()

cnt = 0
for i in range(3):
    if s[i] == t[i]:
        cnt +=1
print(cnt)

Solution (Python):
a=input()
b=input()
count=0
for i in range(3):
  if a[i]==b[i]:
    count+=1
print(count)

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a = X()
b = X()
for i in range(len(a)):
    if a[i]==b[i]:
        cnt+=1

print(cnt)

Solution (Python):
S = input()
T = input()

count = 0
if S[0] == T[0]:
  count += 1
if S[1] == T[1]:
  count += 1
if S[2] == T[2]:
  count += 1
print(count)

Solution (Python):


def main():

    S = input()
    T = input()

    n = len(S)

    ans = 0

    for i in range(n):
        if S[i] == T[i]:
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
t = input()
count = 0
for i in range(len(s)):
    if s[i] == t[i]:
        count += 1
print(count)

Solution (Python):
S = input()
T = input()
cnt = 0
loop = 0
for i in S:
  if i == T[loop]:
    cnt += 1
  loop += 1
print(cnt)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i]==t[i]:
    ans += 1
print(ans)

Solution (Python):
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
def min(a,b):
	if a < b:
		return a
	return b

while t > 0:
	t -= 1
	
	
	s = input()
	r = input()
	ans = 0
	for i in range(0,len(s)):
		if(s[i] == r[i]):
			ans += 1
	print(ans)

Solution (Python):
s = input()
t = input()
count = 0 

for i in range(3):

    if(s[i] == t[i]):
        count = count + 1   



print(count)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Solution (Python):
S = input()
T = input()
count = 0
for s,t in zip(S, T):
  if s == t:
    count += 1
    
print(count)

Solution (Python):
s = input()
t = input()
counter = 0
for i in range(3):
    if s[i] == t[i]:
        counter += 1
print(counter)

Solution (Python):
S = input()
T = input()

ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1

print(ans)

Solution (Python):
print(sum([i==j for i,j in zip(input(),input())]))

Solution (Python):
print(len([1 for i,j in zip(input(),input()) if i==j]))

Solution (Python):
s,t=input(),input();print(len([1 for i in range(3) if s[i]==t[i]]))

Solution (Python):






















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    T = lines[1]
    
    
    
    
    
    
    
    
    
    

    result = 0

    for s, t in zip(S, T):
        if s == t:
            result += 1

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['CSS', 'CSR']
        lines_export = [2]
    if pattern == 2:
        lines_input = ['SSR', 'SSR']
        lines_export = [3]
    if pattern == 3:
        lines_input = ['RRR', 'SSS']
        lines_export = [0]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(2)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

Solution (Python):
s = input()
t = input()
count = 0

for i in range(3):
    if s[i] == t[i]:
        count += 1
        
print(count)

Solution (Python):
s=input()
t=input()
cnt=0
for i in range(3):
    if s[i]==t[i]:
        cnt+=1
print(cnt)

Solution (Python):
S = input()
T = input()

ans = 0
for i in range(3):
  if S[i] == T[i]:
    ans += 1
    
print(ans)

Solution (Python):
s = input()
t = input()
c = 0
for i in range(3):
    if s[i] == t[i]:
        c += 1
print(c)

Solution (Python):
s=input()
t=input()
num=0
for i in range(3):
    if s[i]==t[i]:
        num+=1
print(num)

Solution (Python):
S = input()
T = input()
p = 0
for i in range(3):
  if S[i] == T[i]:
    p+=1
print(p)

Solution (Python):
s=input()
t=input()
cnt=0
for i in range(len(s)):
  if s[i]==t[i]:
    cnt+=1
print(cnt)

Solution (Python):
S=input()
T=input()
ans=0
for x in range(3):
  if S[x]==T[x]:
    ans += 1
print(ans)

Solution (Python):
x=input()
y=input()
c=0
for i in range(3):
  if x[i]==y[i]:
    c = c+1
print(c)

Solution (Python):
x=input()
y=input()
c=0
for i in range(3):
  if x[i]==y[i]:
    c = c+1
print(c)

Solution (Python):
s = input()
t = input()
print(sum(s[i] == t[i] for i in range(3)))

Solution (Python):
s = input()
t = input()

ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1

print(ans)

Solution (Python):
s = list(map(str,input()))
t = list(map(str,input()))

ans = 0
for i in range(len(s)):
    if s[i] == t[i]:
        ans += 1

print(ans)

Solution (Python):
S=input()
T=input()
count=0
for i in range(len(S)):
  if S[i]==T[i]:count+=1
print(count)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Solution (Python):
s=input()
t=input()
cnt=0
for i in range(3):
    if s[i]==t[i]:
        cnt+=1
print(cnt)

Solution (Python):
S=list(input())
T=list(input())
count=0
for i in range(3):
    if S[i]==T[i]:
        count+=1
print(count)

Solution (Python):
s = input()
t = input()

cnt = 0

for i in range(3):
    if str(s[i]) ==  str(t[i]):
        cnt += 1

print(cnt)

Solution (Python):
S = input()
T = input()

print(sum(S[i] == T[i] for i in range(3)))

Solution (Python):
S=input()
T=input()
print(sum(s==t for s,t in zip(S,T)))

Solution (Python):
import sys
S = input()
T = input()

if not ( len(S) == 3 and len(T) == 3 ): sys.exit()
if not ( ('S' in S or 'C' in S or 'R' in S) and ('S' in T or 'C' in T or 'R' in T)):
    sys.exit()

count = 0
for s in range(len(S)):
    if S[s] == T[s]: count += 1

print(count)

Solution (Python):
s = input()
t = input()
ans = 0
for i in range(0,3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Solution (Python):
S = list(input())
T = list(input())
count = 0
for i in range(len(S)):
  if S[i] == T[i]:
    count += 1
print(count)

Solution (Python):
import sys
from collections import deque


def input():
    return sys.stdin.readline().rstrip()


def main():
    S =input()
    T =input()
    count =0
    for i in range(3):
        if S[i] ==T[i]:
            count +=1
    print(count)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
t = input()
ans = 0
for i,j in zip(s,t):
    if i == j:
        ans += 1
print(ans)

Solution (Python):
S = input()
T = input()
ans = 0
for i in range(3):
    ans += S[i] == T[i]

print(ans)

Solution (Python):
S=input()
T=input()
ans = 0
for s,t in zip(S,T):
  if s == t:
    ans += 1
print(ans)

Solution (Python):
S=str(input())
T=str(input())
ans=0
for i in range (3):
    if S[i]==T[i]:
        ans=ans+1
print(ans)

Solution (Python):
S = input()
T = input()
cnt = 0
for i in range(len(S)):
    if S[i] == T[i]:
        cnt += 1
print(cnt)

Solution (Python):
S=input()
T=input()
count=0
for i in range(3):
  if(S[i]==T[i]):
    count+=1
print(count)

Solution (Python):
forecast = input()
actual = input()
correct = 0

for i in range(len(forecast)):
    if forecast[i] == actual[i]:
        correct = correct + 1
print(correct)

Solution (Python):
s = input()
t = input()

ans = 0
for i in range(3):
  if s[i] == t[i]:
    ans += 1
    
print(ans)

Solution (Python):
s = input()
t = input()

ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

Solution (Python):
S = input()
T = input()
res = 0
for i in range(3):
  if S[i] == T[i]:
    res += 1
print(res)

Solution (Python):
s = input()
t = input()
x = 0

for i in range(3):
    if s[i] == t[i]:
        x += 1

print(x)

Solution (Python):
s = input()
t = input()

cnt = 0
for i in range(3):
    if s[i] == t[i]:
        cnt += 1
print(cnt)