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):
n1 = str(input())
n2 = str(input())

n3 = list(n1)
n4 = list(n2)

s1 = 0
for i in range(len(n3)):
    if n3[i] == n4[i]:
        s1 += 1

print(s1)

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

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()
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):
s1=[i for i in input()]
s2=[i for i in input()]

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

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

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

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

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

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

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

count = 0
for i in range(3):
    count += 1 if S[i] == T[i] else 0
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):
s=str(input())
l=str(input())
count=0
if s[0]==l[0]:
    count+=1
if s[1]==l[1]:
    count+=1
if s[2]==l[2]:
    count+=1
print(count)

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

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

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

print(sum)

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

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

ans = 0

cnt = 0
for i in s:
    if i == t[cnt]:
        ans+=1
    cnt+=1

print(ans)

Solution (Python):
s=list(i for i in input())
t=list(i for i in 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 s, t in zip(S, T):
    if s == t:
        ans += 1
print(ans)

Solution (Python):
fore = input()
res = input()
count = 0

for i in range(3):
    if fore[i] == res[i]:
        count += 1

print(count)

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

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


count=0
for i in range(0,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 += 1
print(cnt)

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

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

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

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

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

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

counter = 0

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

print(counter)

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    print(sum([s == t for s, t in zip(input(), input())][:-1]))


if __name__ == "__main__":
    main()

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

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, j in zip(S, T):
    if(i == j):
        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(str(count))

Solution (Python):
forecasts = [c for c in input().strip()]
weather = [c for c in input().strip()]

ans = 0
for f, w in zip(forecasts, weather):
    ans += int(f == w)

print(ans)
exit(0)

Solution (Python):
first = input()
second = input()
count = 0
for i in range(3):
    if first[i] == second[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):
A = str(input())
B = str(input())
result = 0
for i in range(3):
  if A[i] == B[i]:
    result += 1
  else:
    None
print(result)

Solution (Python):
import sys

def solve(s, t):
   ans = 0
   for i, s_i in enumerate(s):
       if s_i == t[i]:
           ans += 1
   print(ans)

if __name__ == '__main__':
  s = sys.stdin.readline().strip()
  t = sys.stdin.readline().strip()
  solve(s, t)

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

result = 0
for i, st in enumerate(S):
    if S[i] == T[i]:
        result += 1

print(result)

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):
    count += 1 if S[i]==T[i] else 0

print(count)

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

Solution (Python):

def main():
    a = list(input())
    b = list(input())
    count = 0

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

    print(count)


if __name__ == '__main__' :
    main()

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

print(cnt)

Solution (Python):



from sys import stdin
import math


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

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


print(cnt)

Solution (Python):
from sys import stdin

if __name__ == '__main__':
    S = stdin.readline().rstrip()
    T = stdin.readline().rstrip()

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

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

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()
print(len([i for i in range(3) if S[i] == T[i]]))

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

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

print(count)

Solution (Python):
while True:
    try:
        S = input()
        T = input()
        result = 0
        for i in range(3):
            if S[i] == T[i]:
                result += 1
        print(result)
    except EOFError:
        break

Solution (Python):


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

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
S=input()
T=input()
cnt=0
l=len(S)

for i in range(l):
	if S[i]==T[i]:
		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):
p = str(input())
a = str(input())
count = 0
for i in range(len(p)):
    if p[i] == a[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):

def main():
    S, T = open(0).read().split()
    ans = sum(s == t for s, t in zip(S, T))
    print(ans)


if __name__ == "__main__":
    main()

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

import copy
import random
import bisect 
import fractions 
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))


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

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

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

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

print(count)

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

Solution (Python):


from sys import stdin, stderr

def main():
   S = stdin.readline()
   T = stdin.readline()

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

   return 0

if __name__ == '__main__': 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()

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

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=list(input())
t=list(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):
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''

gi = lambda : list(map(int,input().split()))
s, t = input(), input()
print(sum([1 if s[k] == t[k] else 0 for k in range(3)]))

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

ct = 0

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

print(ct)

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

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

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

print(cnt)

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

print sum(1 for si, ti in zip(s, t) if si == ti)

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

result = 0

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

print(result)

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

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

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

print(sum)

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()
ans = 0

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

print(ans)

Solution (Python):
Y = input()
K = input()

count = 0
for i in range(3):
  if Y[i] == K[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):
A = input()
B = input()
count = 0

for a, b in zip(A, B):
    if a == b:
        count += 1

print(count)

Solution (Python):
import numpy as np

S = np.array(list(input()))
T = np.array(list(input()))

answer = (S == T)
print(sum(answer))

Solution (Python):


s = input()
t = input()
a = 0
for i, n in enumerate(s):
    if t[i] == n:
        a += 1
print(a)

Solution (Python):


import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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

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

Solution (Python):
yoho = list(input())
kekka = list(input())

a = 0

for i in range(len(yoho)):
  if yoho[i] == kekka[i]:
    a += 1
print(a)

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 = 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):
import numpy as np

s = np.array(list(input()))
t = np.array(list(input()))

print(np.count_nonzero(s==t))

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):
s= str(raw_input())
t= str(raw_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 q,r in zip(s,t):
    if q==r:
        count+=1
print(count)

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):
from sys import stdin, stdout
 
ii = lambda: int(stdin.readline())
mi = lambda: map(int, stdin.readline().strip().split())
li = lambda: list(mi())

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

print(ans)

Solution (Python):


import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    s = lines[0]
    t = lines[1]

    return (s, t)


def solve(s, t):

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


    return count


def main():
    

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Solution (Python):
a = str(input())
b = str(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

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()
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(0,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 = str(input())
t = str(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 x in range(3):
    if S[x]==T[x]:
        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,j in zip(S,T):
    if i == j:
        ans += 1

print(ans)

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

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

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

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

print(result)

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

n=0

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

print(n)

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

s=input()
t=input()

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

print(cnt)

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()
t = stdin.readline().rstrip()

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

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


print(ans)

Solution (Python):


def main():

   S = input()
   T = input()
   count = 0

   for i,j in enumerate(S):
      if T[i] == j:
         count += 1
   print(count)

      

if __name__== "__main__":
    main()

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

Solution (Python):
forecast = list(input())
real = list(input())
number = 0
for i in range(3):
    if forecast[i] == real[i]:
        number += 1
    else:
        pass
print(number)

Solution (Python):
S = list(input())
T = list(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):

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

Solution (Python):

S = list(input())
T = list(input())
print(sum([1 if S[i] == T[i] else 0 for i in range(len(S))]))

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):
if __name__ == '__main__':
    s = list(input())
    t = list(input())

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

Solution (Python):
S = input()
T = 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()
    ans = 0
    for i in range(len(s)):
        if s[i] == t[i]:
            ans += 1
    print(ans)
    
if __name__ == '__main__':
    main()

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

ans = 0

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

print(ans)

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

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

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):
a = input()
b = input()
ct = 0
for i, j in zip(a, b):
    if i == j:
        ct += 1

print(ct)

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 s, t in zip(S, T):
    if s == t:
        c += 1
print(c)

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

Solution (Python):
pred = list(input().strip())
real = list(input().strip())

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

sum = 0

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

print(sum)

Solution (Python):
S = [s for s in input()]
T = [t for t in input()]

print(sum([ 1 if S[i] == T[i] else 0 for i in range(3)]))

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())
ans = 0

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

print(ans)

Solution (Python):
import sys

input = sys.stdin.readline


class AtCoder:
    def main(self):
        S = input().rstrip()
        T = input().rstrip()

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


if __name__ == '__main__':
    AtCoder().main()

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

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

print(ans)

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

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

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

print(an)

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

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

Solution (Python):
import sys


def input():
    return sys.stdin.readline()[:-1]


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


if __name__ == '__main__':
    main()

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

answer = sum(1 for a, b in zip(s, t) if a == b)
print(answer)

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
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()
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()
cnt = sum(1 for a, b in zip(S, T) if a == b)
print(cnt)

Solution (Python):
a=input()
b=input()
c=[]
d=[]
for x in a:
    c.append(x)
for x in b:
    d.append(x)
i=0
n=0
while i<3:
    if c[i]==d[i]:
        n+=1
    i+=1
print(n)

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

a = 0

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

print a

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

print(sum([1 for s, t in zip(S, T) if s == t]))

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

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

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


def input():
    return sys.stdin.readline()[:-1]


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


import sys

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())
i = 0
for s,t in zip(S,T):
    if s == t:
        i += 1

print(i)

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

print(c)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  s=S()
  t=S()

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


print(main())

Solution (Python):


S = input()
T = input()

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

Solution (Python):
prd = str(input())
act = str(input())
ans = 0
for i in range(3):
  if prd[i] == act[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 s, t in zip(S, T):
    if s == t:
        ans += 1
        
print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from collections import *
import math
from bisect import *
import functools
INF = float('inf')
mod = 10**9+7

s, t = input(), input()
c = 0
for x, y in zip(s, t):
    if x == y:
        c += 1
print(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())
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 = input()
T = input()
ans = 0
for i in range(len(S)):
  if S[i] == T[i]:
    ans += 1
print(ans)

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

Solution (Python):
S = list(input())
T = list(input())
ans = 0
for s, t in zip(S, T):
  if s == t:
    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()

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

print(matched)

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

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):
def main(s, t):
    count = 0
    for i in range(len(s)):
        if s[i] == t[i]:
            count += 1

    return count


if __name__ == "__main__":
    s = input()
    t = input()

    print(main(s, t))