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

input = lambda: sys.stdin.readline().rstrip()


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

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

    print(ans)


if __name__ == '__main__':
    solve()

Solution (Python):
s = input()
t = input()
print(sum([ss == tt for ss, tt in zip(s,t)]))

Solution (Python):
import sys
import decimal 

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

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

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

if __name__ == "__main__":
    print(main())

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

Solution (Python):
a = []
for i in range(2):
    a.append(input())

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

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 s,t in zip(list(S), list(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):

import sys
input = sys.stdin.readline









S = input().rstrip()
T = input().rstrip()

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

print(ans)

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

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

print(hit)

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, setrecursionlimit


def main():
    input = stdin.buffer.readline
    s = list(input()[:-1].decode())
    t = list(input()[:-1].decode())

    ans = 0

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

    print(ans)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

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

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=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):
s,t = raw_input(), raw_input()
print sum([1 if u == v else 0 for u,v in zip(s,t)])

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

Solution (Python):

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

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

count = 0
for s, t in zip(S, T):
    count += 1 if s == t else 0
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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
T = input()

print(sum(x==y for x, y in zip(S, T)))

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1 << 32


def solve(S: str, T: str):
    print([S[i] == T[i] for i in range(len(S))].count(True))
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    T = next(tokens)  
    solve(S, T)


if __name__ == '__main__':
    main()

Solution (Python):
S = input().strip()
T = input().strip()
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 resolve():
  s = input()
  t = input()
  ans = 0
  for i in range(3):
    if s[i] == t[i]:
      ans += 1
  print(ans)
  return

if __name__ == "__main__":
  resolve()

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

count = 0

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
from collections import *

S = input()[:-1]
T = input()[:-1]
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().rstrip()
t = input().rstrip()

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

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

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

ans = 0
for s_i, t_i in zip(s,t):
  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 = 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()
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(3):
  if S[i]==T[i]:
    ans+=1
print(ans)

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

Solution (Python):
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


s = S()
t = S()

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

print(sum(s == t for s, t in zip(S, T)))

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

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    S = readline().rstrip()
    T = readline().rstrip()
    ans = 0
    for s, t in zip(S, T):
        if s == t:
            ans += 1
    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):
s=input()
t=input()
ans=0
for i in range(3):
    if s[i]==t[i]:
        ans=ans+1
print(ans)

Solution (Python):
def solve():
  s = input()
  t = input()
  ans = 0
  for i, j in zip(s, t):
    if i == j:
      ans += 1
  print(ans)
  return 0
 
if __name__ == "__main__":
  solve()

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(0, 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()
x=0
if S[0] == T[0]:
  x +=1
if S[1] == T[1]:
  x +=1
if S[2] == T[2]:
  x +=1
print(x)

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

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

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

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

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


if __name__ == "__main__":
    main()

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

print(count)

Solution (Python):
s=input()
t=input()
sum=0
if s[0]==t[0]:
  sum+=1
  
if s[1]==t[1]:
  sum+=1

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

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

ans = 0
for ss, tt, in zip(s, t):
    if ss==tt:
        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()

res = 0
for ss, tt in zip(s, t):
    if ss == tt:
        res += 1
print(res)

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

for i in range(len(s)):
    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):
s = input()
t = input()

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

Solution (Python):
def tenki(s, t):

    ans = 0

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

    return ans

def main():
    s = list(str(input()))
    t = list(str(input()))
    print(tenki(s, t))

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

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

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

cnt = 0

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

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

Solution (Python):


s = list(str(input()))
t = list(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()
b=0
if S[0]==T[0]:
    b+=1
if S[1]==T[1]:
    b+=1
if S[2]==T[2]:
    b+=1
print(b)

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(len(s)):
    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):
a=list(input())
b=list(input())
r=0
for ii in range(len(a)):
  if a[ii]==b[ii]:
    r+=1
print(r)

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


cnt = 0
for s, t in zip(S, T):
    if s == t:
        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):
s = input().rstrip()
t = input().rstrip()
r = 0
for i in range(len(s)):
    if s[i] == t[i]:
        r = r + 1

print(r)

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

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

Solution (Python):
sss = input()
ttt = input()

counter = 0
for s, t in zip(sss, ttt):
  if s == t:
    counter += 1
    
print(counter)

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(int(a[0]==b[0]) + int(a[1]== b[1]) + int(a[2] == b[2]) )

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

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

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

for (i, j) in zip(s, t):
  if(i == j):
    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):
import sys
from io import StringIO
import unittest


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


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """CSS
CSR"""
        output = """2"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """SSR
SSR"""
        output = """3"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """RRR
SSS"""
        output = """0"""
        self.assertIO(input, output)


if __name__ == "__main__":
    
    resolve()

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

Solution (Python):
Ss = input().rstrip()
Ts = input().rstrip()

ans = 0
for S, T in zip(Ss, Ts):
    ans += S == T

print(ans)

Solution (Python):
n = input()
t = input()
count = 0
if n[0] == t[0]:
	count += 1
if n[1] == t[1]:
	count += 1
if n[2] == t[2]:
	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 a, b in zip(s, t):
    if a==b:
        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
import math
import bisect

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

def main():
    print(solve(input(), input()))

if __name__ == "__main__":
    main()

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

cnt = 0

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

print(cnt)

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

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(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):
print(sum(a==b for a,b in zip(*open(0)))-1)

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

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

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


if __name__ == '__main__':
    main()

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

if __name__ == '__main__':

    ABC_139_A()

Solution (Python):
S,T=input(),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()
print(sum(1 for i in range(len(s)) if s[i] == t[i]))

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

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 = (S[0] ==T[0])*1 + (S[1] ==T[1])*1 +(S[2] ==T[2])*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):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


s = S()
t = S()

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


if __name__ == '__main__':
    main()

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

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

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()
L = 0
A = S[0] 
B = S[1]
C = S[2]
D = T[0]
E = T[1]
F = T[2]
if A == D:
    L += 1
if B == E:
    L += 1
if C == F:
    L += 1
print(L)

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

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 sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

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

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

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

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

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 = 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 = 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(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):
import sys, heapq
def LI(): return list(map(int, sys.stdin.readline().split()))
def LS(): return list(sys.stdin.readline())

S = LS()
T = LS()

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

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

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

Solution (Python):
cnt = 0
for a,b in zip(input(),input()):
    if a == b:
        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(len(S)):
	if S[i]==T[i]:
		C+=1
print(C)

Solution (Python):
def main():
    S = input()
    T = input()
    print(sum(1 if s == t else 0 for s, t in zip(S, T)))


if __name__ == '__main__':
    main()

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

print (ans)

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

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

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

i=0
cnt=0
while i <len(s):
  if s[i]==w[i]:
    cnt+=1
  i+=1
  
print(cnt)

Solution (Python):
s, t = input(), 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(3-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, j in zip(s, t):
    if i==j:
        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(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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



    
resolve()

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

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


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