Problem:
 Score : 200 points    Problem Statement Given are strings S and T . Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.  Operation: Choose one character of S and replace it with a different character.      Constraints  S and T have lengths between 1 and 2\times 10^5 (inclusive).  S and T consists of lowercase English letters.  S and T have equal lengths.         Input Input is given from Standard Input in the following format:  S  T       Output Print the answer.        Sample Input 1 cupofcoffee
cupofhottea      Sample Output 1 4  We can achieve the objective in four operations, such as the following:   First, replace the sixth character c with h .  Second, replace the eighth character f with t .  Third, replace the ninth character f with t .  Fourth, replace the eleventh character e with a .        Sample Input 2 abcde
bcdea      Sample Output 2 5       Sample Input 3 apple
apple      Sample Output 3 0  No operations may be needed to achieve the objective.

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

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


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

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

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

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

num = 0
for i, s in enumerate(a, 0):
    if b[i : i + 1] != s:
        num += 1

print(num)

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

Solution (Python):
string = input()
string2 = input()
count = 0

for i in range(0, len(string)):
  if string[i] != string2[i]:
    count += 1
  
print(count)

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

l=list(S)
ll=list(T)
cnt=0
for i in range(len(l)):
  if l[i] != ll[i]:
    cnt +=1
    
print(cnt)

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

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

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

print(cnt)

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

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

print(count)

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

for a, b in enumerate(s):
    if t[a] != b:
        c += 1
        
print(c)

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

N = len(S)
count = 0

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

print(count)

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

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

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

    '''
ababcvcvv
ababababf
    '''

ABC172_B()

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

Solution (Python):

s = list(input())
t = list(input())

count = 0

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

print(count)

Solution (Python):

s = list(input())
t = list(input())

if s == t:
    print(0)
else:
    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(T)):
    if S[i] != T[i]:
        ans+=1

print(ans)

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

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

print(count)

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

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

print(ans)

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

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

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

S=list(S)
T=list(T)

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

print( count)

Solution (Python):
import sys
data = sys.stdin


conversion_data = []
for l in data:
    conversion_data.append(l.split())
    
S = list(conversion_data[0][0])
T = list(conversion_data[1][0])

cnt = 0
min = 0
for i in S:
  if i != T[cnt]:
    min += 1
  cnt += 1
  

print(min)

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

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

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

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

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

Solution (Python):



S = input()
T = input()


def main():
    ans = sum([1 for s, t in zip(S, T) if s != t])
    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
import numpy as np

s = input()
t = input()

li_s = np.array(list(s))
li_t = np.array(list(t))

diff = li_s != li_t
res = np.sum(diff)

print(res)

Solution (Python):
a = input()
b = input()
c = 0
d = 0

for i in a:
    if b[c] != i:
        d = d+1
        c=c+1
    else:
        c=c+1

print(d)

Solution (Python):

line1 = input()
line2 = input()

count = 0

line3 = list(line1)
line4 = list(line2)

len_line3 = len(line3)

for i in range(len_line3):
  if line3[i] != line4[i]:
    count = count + 1

print(count)

Solution (Python):
s = []
t = []
s = input()
t = input()
u = 0

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

print(u)

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

count = 0

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

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

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

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

if S == T :
    print("0")
    exit()

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

print(a)

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

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

Solution (Python):
import numpy as np
a, b = np.array(list(input())), np.array(list(input()))

print(sum(a!=b))

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

Solution (Python):
S = input()
T = input()
index=[n for n in range(len(S)) if S[n]!=T[n]]
print(len(index))

Solution (Python):
from sys import stdin
import sys

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

if s==t:
    print(0)
    sys.exit()
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(len(S)):
    if S[i] != T[i]:
        count += 1
print(count)

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

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

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

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

def solve():
    if (s == t):
        print(0)
        return

    s_len = len(s)

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

    print(cnt)

solve()

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

Solution (Python):
from sys import stdin,stdout
s=input()
t=input()
print(sum([1 for ch,ch1 in zip(s,t) if ch!=ch1]))

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

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

print(ans)

Solution (Python):

S = input()
T = input()

cnt = 0

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

print(cnt)

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

S = list(S)
T = list(T)


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

print(count)

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

Solution (Python):



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

    count = 0

    for i, ch in enumerate(list(t)):
        if ch != s[i]:
            count = count + 1
    
    print(count)


if __name__ == '__main__':
    main()

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, T = list(str(input()).lower()), list(str(input()).lower())
res = 0
for i in range(0, len(S)):
    if S[i] != T[i]:
        res += 1
print(res)

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

Solution (Python):
def main():
    A = input()
    B = input()

    countor = 0

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

    print(countor)


if __name__ == "__main__":
    main()

Solution (Python):
str_list = [input() for _ in range(2)]

count=0

for i in range(0, len(str_list[0])):
    if str_list[0][i] != str_list[1][i]:
        count += 1

print(count)

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

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

n = len(s)

count=0

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

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

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

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

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

print(cnt)

Solution (Python):
s = [input() for i in range(2)] 
a = s[0]
b = s[1]

cnt = 0
for c1,c2 in zip(a, b):
    if c1 != c2:
        cnt += 1
print(cnt)

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

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

print(con)

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

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

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

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

print(ans)

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

print(str(dist))

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

l = len(s)
ans = 0

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

print(ans)

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

Solution (Python):
S=input()
T=input()
count=0
if len(S) == len(T):
    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(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):
def main():
  a=input()
  b=input()
  cnt=0
  for i in range(len(a)):
    if a[i]!=b[i]:
      cnt+=1
  return cnt

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

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




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

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

c=0
for i in range((len(s))):
  if s[i]!=t[i]:
    c = 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):
x=input()
y=input()

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

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

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

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

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

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

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

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


print(result)

Solution (Python):
inlist = [input() for i in range(2)]
stra = inlist[0]
strb = inlist[1]

count = 0
for i in range(len(stra)):
    if stra[i] != strb[i]:
      count += 1

print(count)

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

ans = 0

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

print(ans)

Solution (Python):
s = input()
t = input()
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())
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()
print(sum(s != t for s, t in zip(S, T)))

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

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

Solution (Python):
try:
    s=input()
    p=input()
    count=0
    for i in range(len(s)):
        if s[i]!=p[i]:
            count+=1
    print(count)
except:
    pass

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

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=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(len(s) - cnt)

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

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

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

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

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

a = 0

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

print(a)

Solution (Python):





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

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

print(x)

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

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

exit()

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
for i in range(len(a)):
  if a[i] != b[i]:
    c += 1
print(c)

Solution (Python):
a1=input()
a=list(a1)
b1=input()
b=list(b1)
c=len(a)
d=0
e=0
for i in range(int(c)):
    if a[i]==b[i]:
        d=d+1
    else:
        e=e+1

print(e)

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

count = 0
for item in zip(s,t):
    if item[0] != item[1]:
        count += 1
print(count)

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

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    s = input()
    t = input()
    cnt = 0
    for i in range(len(s)):
        if s[i] != t[i]:
            cnt += 1
    print(cnt)

if __name__ == '__main__':
    main()

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

if S==T:
    print(0)
else:
    total_diff_count = 0
    length = len(S)
    for i in range(length):
        if S[i] != T[i]:
            total_diff_count += 1
    print(total_diff_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):
import sys

def L(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())

import collections

def solver(S,T):

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



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

    solver(S,T)

if __name__ == '__main__':
    main()

Solution (Python):
s=input()
t=input()
l=len(s)
ans=0
for i in range(l):
    if s[i]==t[i]:
        pass
    else:
        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):
S = list(input())
T = list(input())
num = 0
for i in range(len(S)):
    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=ans+1

print(ans)

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

false = 0

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

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

count = 0

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

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

Solution (Python):
S = list(str(input()))
T = list(str(input()))
g = 0
for i in range(len(S)):
  if S[i] != T[i]:
    T[i] = S[i]
    g += 1
  else:
    continue
print(g)

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

if S==T:
    print(0)
else:
    count=0
    for i1,s1 in enumerate(S):
        if T[i1]!=s1:
            count+=1
    print(count)

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

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

print(count)

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

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

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

print(count)

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

ans = 0

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

print(ans)

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

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

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

ans=0
b=len(s)

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

print(ans)

Solution (Python):
S = input()

T = input()
j = 0

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

print(j)

Solution (Python):


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

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

print(ans)

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

cnt = 0
for s_word, t_word in zip(S,T):
  if s_word != t_word:
    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):
S = input()
T = input()
count = 0

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

print(count)

Solution (Python):
import math

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

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

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

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

print(count)

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

ans = 0

if S == T:
    ans = 0
else:
    for i, j in zip(S, T):
        if i != j:
            ans += 1

print(ans)

Solution (Python):
s = list(input())
t = list(input())
ans = 0
for i, e in enumerate(s):
    if e != t[i]:
        ans += 1
print(ans)

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

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

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

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

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

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

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

Solution (Python):
import numpy as np
s = [input() for i in range(2)]
a=np.array(list(s[0]))
b=np.array(list(s[1]))

print(np.sum(a != b))

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

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

print(len(S)-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()

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

print(count)

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

Solution (Python):
S=input()
T=input()
print(len([ 1 for s,t in zip(list(S),list(T)) if s!=t ]))

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

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

print(count)

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

counter = 0
for i in range(len(s)):

    if t[i] != s[i]:
        
        
        counter += 1

print(counter)

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

print(count)

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

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

print(count)

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

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

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

print(counter)

Solution (Python):
from sys import stdin

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

cnt = 0
for c1,c2 in zip(a, b):
  if c1 != c2:
    cnt += 1

print(cnt)

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

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

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

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

Solution (Python):
data=input()
mirror=input()
count=0
if data==mirror:
    print(0)
else:
    for i in range(len(data)):
        if data[i]!=mirror[i]:
            count=count+1

    print(count)

Solution (Python):
def main():
    S = input().rstrip()
    T = input().rstrip()
    
    c = 0
    for s, t in zip(S, T):
        if(s != t):
            c += 1
    print(c)
    
if __name__ == "__main__":
    main()

Solution (Python):
strings = [input() for i in range(2)]

num = 0
for i in range(len(strings[0])):
  if strings[0][i] != strings[1][i]:
    num += 1
    
print(num)

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

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

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

Solution (Python):
S = str(input())
T = str(input())
a = 0
b = len(T)

if  (1 <=  len(S) <= 2*10**5) and (1 <= len(T) <= 2*10**5) and len(S) == len(T):
    for i in range(b):
        if S[i] != T[i]:
            a += 1
print(a)

Solution (Python):


S = input().strip()
T = input().strip()


cnt = 0

for i,char in enumerate(S):
    if char != 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 = Ans + 1
print(Ans)

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

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

if S == T:
  print(0)
else:
  ans = 0

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

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

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

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

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

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

Solution (Python):
s = input()
t = input()
print(sum(1 for a, b in zip(s, t) if a != b))

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

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

print(ans)

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

Solution (Python):
s = input()
t = input()
result = 0
con1 = len(s) >= 1 and len(s) <= 200000
con2 = len(t) >= 1 and len(t) <= 200000
if con1 == True and con2 == True and len(s) == len(t):
    for i in range (0, len(s)):
        if s[i] != t[i]:
            result = result + 1
        else:
            continue
    print(result)
else:
    print()

Solution (Python):


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

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

print(cnt)

Solution (Python):
def A(x):
  return x + x**2 + x**3


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


def C(N):
  pass


def main():
  s = input()
  t = input()
  print(B(s, t))
  
  
  
  


if __name__ == '__main__':
  main()

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

str2=str(input())

count=0

for i in range(0,len(str1)):
  if str1[i]!=str2[i]:
    count+=1
    
    
print(count)

Solution (Python):
x = input()
y = input()
xx = list(x)
yy = list(y)
s = 0
for nn in range(len(xx)):
     if xx[nn] != yy[nn]:
         s += 1
print(s)

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

l=len(s)

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

print(ans)

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

for i, word in enumerate(S):
    if word == T[i]:
        pass
    else:
        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 = input()
T = input()

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

Solution (Python):
start = input()
target = input()


cnt = 0
for i in range(len(start)):
    if start[i] != target[i]:
        cnt += 1


print(cnt)

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

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