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

a = 0

for i in range(0,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()

flag=0

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

print(flag)

Solution (Python):
from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
mod = 10**9+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(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
  else:
    next
    
print(c)

Solution (Python):
S = str(input())
T = str(input())
ans = 0
for i in range(0, 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+=1
print(c)

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

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

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

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

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

Solution (Python):

s,t = input(), input()

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

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

Solution (Python):
str1 = input()
str2=input()

count=0
if str1[0]==str2[0]:
    count=count+1
if str1[1]==str2[1]:
    count=count+1
if str1[2]==str2[2]:
    count=count+1

print (count)

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

counter = 0

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

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

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

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

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

print(ret)

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

Solution (Python):
print(len(list(filter(lambda x:x[0]==x[1],zip(input(), input())))))

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

s=[]
t=[]
for i in S:
    s.append(i)
for j in T:
    t.append(j)


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

print(str(count))

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

print(c)

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

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

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

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

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

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

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

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

count = 0

for i in range(3):
    if s[i] == r[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 = [str(x) for x in input()]
T = [str(x) for x in input()]
k = 0

for a in range(0, len(S)):
    if S[a] == T[a]:
        k = k + 1
print(k)

Solution (Python):
def tenki(F, A):
    s=0
    for i in range(len(F)):
        if F[i] == A[i]:
            s = s + 1
    return s

F=input()
A=input()
print(tenki(F,A))

Solution (Python):

S = input()

T = input()

Count = 0


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

print("{}".format(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(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=raw_input()
t=raw_input()
cnt=0
for i in xrange(3):
 if s[i]==t[i]:
  cnt+=1
print cnt

Solution (Python):
a = input().rstrip()
b = input().rstrip()
count = 0

if(a[0]==b[0]):
  count+=1
if(a[1]==b[1]):
  count+=1
if(a[2]==b[2]):
  count+=1
print(count)

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

Solution (Python):
s = input()
t = input()
cnt = 0
for i in range(3):
    if 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):
import numpy as np
S = list(input())
T = list(input())
F= (np.array(S) == np.array(T))
ans = 0
for i in F:
  if i == True:
    ans += 1

print(ans)

Solution (Python):
def solve(s, t):
    return sum([a == b for a,b in zip(s, t)])

s = input()
t = input()
print(solve(s, t))

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

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
    else :
        continue

print(count)

Solution (Python):
from sys import stdin
 
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()

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

print(count)

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

cnt = 0

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

print(cnt)

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

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

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

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

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

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

print(count)

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

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

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

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

q = 0

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

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

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

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

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

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

print(count)

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))



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([si==ti for si,ti in zip(s,t)]))

Solution (Python):
import sys
input = sys.stdin.readline
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 = str(input())
t = str(input())

s = [_ for _ in s]
t = [_ for _ in t]

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

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

count = 0
for i in range(3):
    if exe[i] == real[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):
list_s = [str(i) for i in input()]
list_t = [str(i) for i in input()]
count = 0

for i in range(3):
    if list_s[i] == list_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()

output=0

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

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

Solution (Python):
from __future__ import print_function


import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd

def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq

def reduce(p, q):
    common = fractions.gcd(p, q)
    return (p//common , q//common )



import random


def main():
    S=input().strip()
    T=input().strip()
    cnt=0
    for i in range(len(S)):
        if S[i]==T[i]:
            cnt+=1
    print(cnt)
    return

if __name__ == '__main__':
    main()

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

i = 0
match = 0

while i < 3:
    if forecast[i] == actual[i]:
        match += 1  
    i += 1

print(match)

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

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

count = 0

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

print(count)

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

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

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

print(sum([i == j for i, j in zip(S, T)]))

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

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

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

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

Solution (Python):
def solve(string):
    s, t = string.split()
    return str(sum([_s == _t for _s, _t in zip(s, t)]))


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))

Solution (Python):
l = input()
t = input()
c = 0
for i in range(0,3):
  if l[i] == t[i]:
    c = c+1
  else:
    continue

print(c)

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

counter = 0
correct = 0
while counter < 3:
  if cast[counter] == real[counter]:
    correct += 1
  counter += 1
print correct

Solution (Python):
a = input()
b = input()
score = 0

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

print(score)

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()
print((s[0] == t[0]) + (s[1] == t[1]) + (s[2] == t[2]))

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

Solution (Python):


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


if __name__ == "__main__":
    solve()

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

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

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

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()
print((s[0]==t[0])+ (s[1]==t[1])+(s[2]==t[2]) )

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

Solution (Python):
l = input()
s = input()
total = 0
i = 0
while i < 3:
  if l[i] == s[i]:
    total = total + 1
  i = i + 1

print(total)

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

ans = 0
for s_, t_ in zip(s, t):
    if s_ == t_:
        ans += 1

print(ans)

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

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

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

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

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

Solution (Python):
import sys

s = raw_input()
t = raw_input()

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

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

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

Solution (Python):
ss = input()
tt = input()

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

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

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 = input("")
t = input("")
s_list = list(s)
t_list = list(t)
n = 0

for i in range(3):
    if s_list[i] == t_list[i]:
        n += 1

print(n)

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

Solution (Python):
n=input()
s=input()
ans=0
for i in range(len(n)):
    if s[i]==n[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):
s1 = input()
s2 = input()
ans = 0
for i in range(3):
  if s1[i] == s2[i]:
    ans += 1
print(ans)

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

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

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

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

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

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


count=0

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


print(count)

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

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

print(ans)

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

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):
print(sum(a == b for a, b in 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):
s=input()
t=input()
print(sum( x==y for x,y in zip(s,t)))

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

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

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

result = 0

print(sum(1 if _s == _t else 0 for _s, _t in zip (s, t)))

Solution (Python):
x = list(input())
y = list(input())

i = 0
count = 0

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

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

print(answer)

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

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

print(res)

Solution (Python):
sus = input()
tru = input()
cnt = 0

for i in range(3):
  if sus[i] == tru[i]:
    cnt += 1

print(cnt)

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

print(k)

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

a = list(a)
b = list(b)

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

print(result)

Solution (Python):
if __name__ == '__main__':
    S, T = [input() for _ in range(2)]
    print(len([True for s, t in zip(S, T) if s == t]))

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

Solution (Python):
a = input()
b = input()
print([a[i] == b[i] for i in range(len(a))].count(True))

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

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 collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import heapq, bisect
import math
import itertools





def main():
    s = list(input())
    t = list(input())

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




if __name__ == '__main__':
    main()

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

Solution (Python):
from sys import exit, stderr, stdin
input = stdin.readline


def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():

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

if __name__ == "__main__":
    main()

Solution (Python):
x=input()
y=input()
ans=0
if(x[0]==y[0]):
  ans+=1
if(x[1]==y[1]):
  ans+=1
if(x[2]==y[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):
print( sum([1 for x, y in zip(input(), input()) if x == y]) )

Solution (Python):




import math
import statistics

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

Solution (Python):
p = input()
r = input()

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

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

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

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

counter = 0
for i, j in zip(S, T):
    if i == j:
        counter += 1
    
print(counter)

Solution (Python):


import sys
import copy
import math

sys.setrecursionlimit(1000000)





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

ans = 0

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

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

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

print(ans)

Solution (Python):





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

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()
print(sum([S[i]==x for i,x in enumerate(input())]))

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

Solution (Python):
yohou=list(input())
kekka=list(input())
cnt=0
for yo, ke in zip(yohou,kekka):
  if yo == ke:
    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, t = input(), input()
print(sum([x == y for x, y in zip(s, t)]))

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

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

ai = list(a)
bi = list(b)

j = 0
for i in range(3):
    if ai[i] == bi[i]:
        j += 1

print(j)

Solution (Python):
a,b=open(0);c=0
for i in range(3):
	c+=bool(a[i]==b[i])
print(c)

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

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

Solution (Python):
a, b = input(), input()
cnt = 0
if a[0] == b[0]:
    cnt += 1
if a[1] == b[1]:
    cnt += 1
if a[2] == b[2]:
    cnt += 1
print(cnt)

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

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

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

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

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

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

Solution (Python):
S = input()
T = input()
cnt = 0
for ind,s in enumerate(S):
    if(s==T[ind]):
        cnt+=1
print(cnt)

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

Solution (Python):


yoho = list(input())
tenki = list(input())
ans = 0
if yoho[0] == tenki[0]:
    ans += 1
if yoho[1] == tenki[1]:
    ans += 1
if yoho[2] == tenki[2]:
    ans += 1



print(ans)

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

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

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

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

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

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

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

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

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

cnt=0

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

print(cnt)

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

c=0

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

Solution (Python):
forecast_w=input()
actual_w=input()
n=0
for i in range(3):
    if forecast_w[i]==actual_w[i]:
        n+=1
print(n)