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):
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())

r = 0
for i, x in enumerate(S):
    if x == T[i]:
        r += 1
print(r)

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

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

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

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

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):
a = input()
b = input()
print(sum([a[i] == b[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()
ans=0
for i in range(len(S)):
  if S[i] == T[i]:
    ans+=1
print(ans)

Solution (Python):

 
import math
import itertools
import sys
import copy
 


S = str(input())
T = str(input())

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

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

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

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

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

c=0
for i in range(3):
    if S[i]==T[i]:
        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()
count = 0

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

print(count)

Solution (Python):
S = input().strip()
T = input().strip()
N = len(S)
c = 0

for i in range(N):
    if S[i] == T[i]:
        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 = str(input())
t = str(input())
cnt = 0

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

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 = input()
t = input()
n = 0
for i in range(3):
  if s[i] == t[i]:
    n += 1
print(n)

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):
s1 = input()
s2 = input()
ans = 0
for i, j in zip(s1, s2):
    if i == j:
        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 = [s for s in input()]
T = [t for t in 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):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    print(sum(s==t for s,t in zip(input(),input())))
resolve()

Solution (Python):
from sys import stdin

a=  stdin.readline().rstrip()
b=  stdin.readline().rstrip()

count = 0
for i,j in zip(a,b):
    if i ==j:
        count += 1



print(count)

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

res = 0
for s, t in zip(S, T):
    if s==t:
        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):
a=input()
b=input()
if a[0]==b[0]:
  A=1
else:
  A=0
if a[1]==b[1]:
  B=1
else:
  B=0
if a[2]==b[2]:
  C=1
else:
  C=0
print(A+B+C)

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()
weather=input()
cnt=0

for k in range(3):
    
    if forecast[k]==weather[k]:
        cnt+=1
        
print(cnt)

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

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

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 = list( str( input() ) )
T = list( str( input() ) )
match = [ S[x] == T[x] for x in range(3) ]
print( sum( match ) )

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

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 = 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()
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(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):
import sys

S = input()
T = input()
count=0
i=0
while(i<=2):
	if S[i:i+1]==T[i:i+1]:
		count+=1
	i+=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 = str(input())
T = str(input())
ans = 0

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

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

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

cnt = 0
for i, c in enumerate(s):
    if t[i] == c:
        cnt += 1

print(cnt)

Solution (Python):
S = input()
T = 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(3):
      if s[i]==t[i]:
            ans+=1
print(ans)

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

if s[0] == t[0]:
    a = 1
else:
    a = 0

if s[1] == t[1]:
    b = 1
else:
    b = 0

if s[2] == t[2]:
    c = 1
else:
    c = 0

print(a + b + c)

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

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

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

ans=0
for i in range(3):
  if a[i]==b[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())

print(len([1 for i in range(3) if S[i] == T[i]]))

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

count = len(s)

ans = 0

for i in range(count):
    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):

import numpy as np
def main():
    s = input().split()
    t = input().split()
   
    ans = 0
    for i in range(3):
        if s[0][i] == t[0][i]:
            ans += 1

    print(ans)

    
if __name__ == '__main__':
    main()

Solution (Python):
a = [i for i in input()]
b = [i for i in input()]
print(len([i for i in range(3) if a[i]==b[i]]))

Solution (Python):
a = [i for i in input()]
b = [i for i in input()]
cnt = 0
for i in range(3):
  if a[i] == b[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):
a = input()
b = input()
c =0
for i in range(3):
  if a[i]==b[i]:
    c +=1
print(c)

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

def main():
    s, t = input(), input()
    print(sum([1 for i in range(3) if s[i] == t[i]]))

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 = list(input())
t = list(input())

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

print(cnt)

Solution (Python):
fore = input()
real = input()

ct = 0
for i in range(len(fore)):
  if fore[i] == real[i]:
    ct += 1
 
print(ct)

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

if S[0]==T[0] and S[1]==T[1] and S[2]==T[2]:
    print("3")
elif S[0]==T[0] and S[1]==T[1] and S[2]!=T[2]:
    print("2")
elif S[0]==T[0] and S[1]!=T[1] and S[2]==T[2]:
    print("2")
elif S[0]!=T[0] and S[1]==T[1] and S[2]==T[2]:
    print("2")
elif S[0]==T[0] and S[1]!=T[1] and S[2]!=T[2]:
    print("1")
elif S[0]!=T[0] and S[1]==T[1] and S[2]!=T[2]:
    print("1")
elif S[0]!=T[0] and S[1]!=T[1] and S[2]==T[2]:
    print("1")
else:
    print("0")

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

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

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

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(sum(map(lambda x: int(x[0] == x[1]), zip(list(input()), list(input())))))

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
input = sys.stdin.readline

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()
counter = 0
for i in range(3):
  if s[i] == t[i]:
    counter += 1
print(counter)

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 = [i for i in input()]
t = [i for i in 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
if S[0] == T[0]:
    ans = ans+1
if S[1] == T[1]:
    ans = ans+1
if S[2] == T[2]:
    ans = ans+1
print(ans)

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

result=0
if s[0]==t[0]:
    result+=1
if s[1]==t[1]:
    result+=1
if s[2]==t[2]:
    result+=1

print(result)

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

Solution (Python):
yo = list(input())
ji = list(input())
a = 0
if yo[0] == ji[0]:
    a += 1
if yo[1] == ji[1]:
    a += 1
if yo[2] == ji[2]:
    a += 1

print(a)

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 = [input() for i in range(2)]

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

print(count)

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(len(s)):
    if s[i] == t[i]:
        ans +=1

print(ans)

Solution (Python):
pred = input()
aw = input()

counter = 0
for i in range(len(pred)):
    if pred[i] == aw[i]:
        counter += 1
        
print(counter)

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

Solution (Python):

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

Solution (Python):
s=list(input());p=list(input())
st=0
list=0,2,4
for i in range(3):
    if s[i]==p[i]:
        st+=1
print(st)

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=str(input())
T=str(input())
count=0

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

Solution (Python):
a = input().strip()
b = input().strip()
cnt = 0
for i, j in zip(a, b):
  if i == j:
    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 s, t in zip(S, T):
    if s == t:
        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()
cnt = 0
for i in range(3):
  if S[i] == T[i]:	cnt+=1
print(cnt)

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

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

print(g)

Solution (Python):
s1=input()
s2=input()
count=0
if s1[0]==s2[0]:
  count+=1
if s1[1]==s2[1]:
  count+=1
if s1[2]==s2[2]:
  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()

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

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

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

sum = 0

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

print(sum)

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

Sum = 0

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

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

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

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

Solution (Python):
S=list(str(input()))
T=list(str(input()))
p=0

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

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

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

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

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(3):
    if s[i] == t[i]:
        cnt += 1

print(cnt)

Solution (Python):
import numpy as np
S = np.array(list(input()))
T = np.array(list(input()))

print(np.sum(S == T))

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

Solution (Python):
s = [input() for i in range(2)]
 
ans=0
for a,b in zip(s[0],s[1]):
  if a==b:
    ans+=1
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 = 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 = sum([si == ti for si, ti in zip(s, t)])
print(ans)

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

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

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

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

Solution (Python):
import numpy as np
S = np.array(list(input()))
T = np.array(list(input()))
print((S == T).sum())

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

Solution (Python):
S = str(input())
T = str(input())
result = 0
if S[0] == T[0]:
    result += 1   
if S[1] == T[1]:
    result += 1
if S[2] == T[2]:
    result += 1
print(result)

Solution (Python):
S=list(map(str,input()))
T=list(map(str,input()))
count=0

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

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):
print(sum(i==j for i,j in zip(input(),input())))

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()

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 = list(input())
t = list(input())

cnt = 0

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

print(cnt)

Solution (Python):
A = input()
B = input()
RET = 0
for i in range(len(A)):
  if A[i]==B[i]:
    RET +=1
print(RET)

Solution (Python):
str1 = input()
str2 = input()
count = 0
for i in range(3):
    if(str1[i] == str2[i]):
        count+=1


print(count)

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

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(str(input()))
t = list(str(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
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 = 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()
x = 0
for i in range(3):
  x += s[i-1]==t[i-1]
print(x)

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

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

Solution (Python):


s = raw_input()
t = raw_input()

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

print ans

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

s=input().rstrip()
t=input().rstrip()
n=len(s)
ans=0
for i in range(n):
    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 = 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()
res = 0
for i in range(3):
    if s[i] == t[i]:
        res += 1

print(res)

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

Solution (Python):
S, T = [input() for _ in range(2)]

correct = sum(a == b for a, b in zip(S, T))

print(correct)

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

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

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

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

print(buf)

Solution (Python):
s = str(input())
t = str(input())
i = 0
ac = 0
while(i < 3):
    if (s[i] == t[i]):
        ac += 1
    i += 1
print(ac)

Solution (Python):
a = [c for c in input()]
b = [c for c in input()]
print(sum(1 for c, z in zip(a, b) if c == z))

Solution (Python):
S=list(input())
T=list(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())
x = 0
for i in range(len(S)):
	if S[i] == T [i]:
		x += 1
print(x)

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

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

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

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()
print(sum([s[i] == t[i] for i in range(3)]))

Solution (Python):
s=raw_input().rstrip()
t=raw_input().rstrip()
print sum([si == ti for (si, ti) in zip(s,t)])

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

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

print(score)

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 = list(input())
T = list(input())

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

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

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()
ans=0
for i in range(3):
    if s[i]==t[i]:
        ans+=1
print(ans)

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()
ans=0
for i in range(len(s)):
    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):
import sys
from operator import itemgetter 
from fractions import gcd 
from math import ceil, floor, sqrt 
from copy import deepcopy 
from collections import Counter, deque 
import heapq
from functools import reduce
sys.setrecursionlimit(200000)

input = sys.stdin.readline



s = input()
c = input()

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

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

Solution (Python):

import sys














def main():
    s, t = sys.stdin.read().split()

    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()
index=0
cnt=0
for i in s:
    if i == t[index]:
        cnt+=1
    index+=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):
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())
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(0,3):
    if s[i]==t[i]:
        count+=1
print(count)

Solution (Python):
S = input()
T = input()
print(sum(int(S[i] == T[i]) for i in range(3)))

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())
s=list(S)
t=list(T)
count=0
for i in range(len(S)):
    if s[i]==t[i]:
        count +=1
print(count)

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

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()
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())
c = 0
for i in range(3):
    if s[i] == t[i]:
        c += 1
print(c)

Solution (Python):
S=list(map(str,input()))
T=list(map(str,input()))
count=0

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b



def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)



def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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

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):
import sys

A = sys.stdin.readline()
B = sys.stdin.readline()
ans = 0

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

Solution (Python):
import math
import sys
input = sys.stdin.readline


def main():
    sc = Scan()
    s = sc.strarr()[0]
    t = sc.strarr()[0]
    count = 0
    for ss, tt in zip(s, t):
        if ss == tt:
            count += 1
    print(count)


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


main()

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())


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()

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

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

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

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()

tenki = 0

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

print(tenki)

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

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

print(count)

Solution (Python):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]



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



def B():
    return



def C():
    return



def D():
    return



def E():
    return



def F():
    return



def resolve():
    A()
    return



if __name__ == "__main__":
    A()

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() for i in range(2)]
cnt = 0
for i in range(3):
    if s[0][i] == s[1][i]:
        cnt = 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):
s1 = input()
s2 = input()
cnt = 0

for ss1, ss2 in zip(s1, s2):
    if ss1 == ss2:
        cnt += 1

print(cnt)

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

Solution (Python):
s = list(str(input()))
t = list(str(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()
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()

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

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

Solution (Python):
ls_s = [s for s in input()]
ls_t = [t for t in input()]

cnt = 0

for i in range(3):
    if ls_s[i] == ls_t[i]:
        cnt += 1

print(cnt)

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

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