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

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

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

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

D = 0

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

print(D)

Solution (Python):
s = str(input())
t = str(input())
score = 0
le = len(s)

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

print(score)

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

l = len(S)
count = 0

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

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

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

idx = 0
cnt = 0
for _ in range(len(str1)):
    if str1[idx] != str2[idx]:
        cnt += 1
    idx += 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()
assert len(S) == len(T)
print(len([(s,t) for s,t in zip(S,T) if s != t]))

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

Solution (Python):




def solve():
    s = input()
    t = input()
    res = 0
    for a,b in zip(s,t):
        if a != b:
            res += 1
    print(res)







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(len(S)):
  if S[i] != T[i]:
    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):
a = list(input())
b = list(input())

ans = 0
for p, q in zip(a, b):
    if p != q:
        ans += 1
print(ans)

Solution (Python):
def main():
    s = input()
    t = input()
    ans = 0
    
    for i, j in zip(s, t):
        if i != j:
            ans += 1
    print(ans)
        
        
if __name__ == '__main__':
    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 = str(input())
T = str(input())


result = 0

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

Solution (Python):

import sys
sys.setrecursionlimit(1000000)
from collections import deque

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

print(count)

Solution (Python):
s=input()
t=input()
count=0
for i in range(0,len(s)):
    if(s[i]==t[i]):
        continue
    else:
        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
    elif s[i]!=t[i] :
        t[i] = s[i]
        count += 1
        
print(count)

Solution (Python):

"""
Created on Fri Sep 18 19:19:52 2020

@author: ezwry
"""

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

Solution (Python):

    
    


import sys, os.path


    
    

sys.setrecursionlimit(10 ** 5)

def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))



def solve():
    a=li();b=li();c=0
    for i in range(len(a)):
        if a[i]!=b[i]:
            c+=1
    print(c)
for _ in range(1):
    solve()

Solution (Python):
s = list(map(str, input()))
t = list(map(str, input()))

ans = 0

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

print(ans)

Solution (Python):
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())

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

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

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

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

print(ans)

Solution (Python):
n = list(input())
n1 = list(input())

i = 0
cou = 0
while i != len(n):
    if n[i] != n1[i]:
        cou += 1
    i += 1

print(cou)

Solution (Python):

ans = 0

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

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

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 = str(input())
B = str(input())
c = 0
lenA = len(A)
for i in range(lenA):
    if A[i] != B[i]:
        c += 1
print(c)

Solution (Python):
a = input()
b = input()
count = 0
a = list(a)
b = list(b)
for i in range(len(a)):
    if a[i]!=b[i]:
        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]:
        continue
    else:
        cnt += 1
print(cnt)

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

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

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

print(ans)

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

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

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

cnt = 0

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

print(cnt)

Solution (Python):
s_l = list(input())
t_l = list(input())

count_difference = 0
for s, t in zip(s_l, t_l):
    if s != t:
        count_difference += 1

print(count_difference)

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

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

print(count)

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

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

print(cnt)

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

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

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

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

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)
a = 0

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

print(a)

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

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

print(result)

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

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

ans = 0

for c1,c2 in zip(S,T):
    if c1 != c2:
        ans +=1

print(ans)

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

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

print(ans)

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

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

Solution (Python):
def main(S, T):
    N = len(S)
    ans = 0
    for i in range(N//2):
        if S[i] != T[i]:
            ans += 1
        if S[-1-i] != T[-1-i]:
            ans += 1
    if N%2 == 1:
        if S[N//2] != T[N//2]:
            ans += 1
    return ans

if __name__ == '__main__':
    S = input()
    T = input()
    ans = main(S, T)
    print(ans)

Solution (Python):
def main(S, T):
    ans = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            ans += 1
    return ans

if __name__ == '__main__':
    S = input()
    T = input()
    ans = main(S, T)
    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()

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

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

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

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

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

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

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

Solution (Python):
S=[i for i in input()]
T=[j for j in input()]

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

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

count = 0

for s, t in zip(S,T):
    if s != t:
        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()
ans = 0
for count, i in enumerate(T):
    if(S[count] != i):
        ans = 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=str(input())
T=str(input())
c=len(S)
for i in range(len(S)):
    if S[i]==T[i]: c=c-1

print(c)

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

Solution (Python):
a = list(input())
b = list(input())
num = len(a)
S = 0

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

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

Solution (Python):

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

Solution (Python):
print(sum(x!=y for x,y in zip(input(),input())))

Solution (Python):
S = input()
T = input()
count = 0
for u, v in zip(S, T):
    if u != v:
        count += 1
print(count)

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

res = 0

for i, char in enumerate(a):
  if char != b[i]:
    res += 1

print(res)

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

length = len(S)
count = 0

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

Solution (Python):
s = input()
t = input()
c = 0
for i in range(len(s)):
  if not s[i] == t[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
ans = count
print(ans)

Solution (Python):
s, t = [input() for i in range(2)]
i = 0
for a, b in zip(s, t):
  if a != b:
    i += 1
print(i)

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

if '__main__' == __name__:
    resolve()

Solution (Python):
s=input()

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

print(cnt)

Solution (Python):


S = list(input())
T = list(input())
length = len(S)

ans = 0

for i in range(length):

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

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

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

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


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s = input()
    t = input()
    cunt=0
    for i, ss in enumerate(s):
        if ss != t[i]:
            cunt+=1
    print(cunt)

if __name__=='__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s = input()
    t = input()
    cunt=0
    for i, ss in enumerate(s):
        if ss != t[i]:
            cunt+=1
    print(cunt)

if __name__=='__main__':
    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):
first_string = input()
second_string = input()
count = 0

for x, y in zip(first_string, range(len(first_string))):
    if(second_string[y] != x):
        count += 1
print(count)

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

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

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

for i, j in zip(s, t):
    ans += i != j

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

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

Solution (Python):

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
import math
import sys
import os
from operator import mul

sys.setrecursionlimit(10**7)

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

if os.getenv("LOCAL"):
    inputFile = basename_without_ext = os.path.splitext(os.path.basename(__file__))[0]+'.txt'
    sys.stdin = open(inputFile, "r")
INF = float("inf")

S = list(_S())
T = list(_S())
ans = 0

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

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

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

for si, ti in zip(s, t):
    if si != ti:
        ans += 1

print(ans)

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

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

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

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

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

num = len(ls1)

ans = 0

for i in range(num):
    if ls1[i] != ls2[i]:
        ans += 1

print(ans)

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

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

x = len(s)
count = 0

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

print(count)

Solution (Python):
n_s = list(input().rstrip())
n_t = list(input().rstrip())
cnt = 0
for i in range(len(n_s)):
    if n_s[i] != n_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 += 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)):
    ans += S[i] != T[i]

print(ans)

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

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

word = list(s)
answer = list(t)

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

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

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

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
S = list(map(str, input()))
T = list(map(str, 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, c in enumerate(s):
    if t[i] != c: cnt += 1
print(cnt)

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

print(ans)

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

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

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

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

Solution (Python):
def solver(S,T):
    counter = 0
    for i in range(len(S)):
        Si = S[i]
        Ti = T[i]
        if Si != Ti:
            counter += 1
    return counter

S = input()
T = input()
print(solver(S,T))

Solution (Python):
s=input()
n=input()
a=len(s)
ans=0
for m in range(a):
  if s[m]!=n[m]:
    ans=ans+1
print(ans)

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):
def main():
    s = input()
    t = input()
    length = len(s)
    ans = 0

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

    print(ans)


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

Solution (Python):
s = input()
t = input()
cnt = 0
for (x, y) in zip(s, t):
  if x != y:
    cnt += 1
print(cnt)

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

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

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

print(count)

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

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

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

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

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

print(result)

Solution (Python):


s, t = (list(a for a in input()) for b in range(0, 2))
count = 0
length = len(s)
for i in range(length):
    if s[i] != t[i]: count += 1

print(count)

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

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

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

i = 0
cn = 0
N = 200000



while i < L:
    if S[i] != T[i]:
        i = i + 1
        cn = cn + 1
    else:
        i = i + 1

print(cn)

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

import sys
import numpy as np




s = str(input())
t = str(input())
ans = 0
for i, j in zip(s,t):
	if i != j:
		ans += 1

print(ans)

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

Solution (Python):
s=input()
t=input()
c=0
for s1,t1 in zip(s,t):
    c+=s1!=t1
print(c)

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

print(r)

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

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

print(cnt)

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

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

print(cnt)

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

count = 0

zip(S, T)

for x, y in zip(S, T):
    if x != y:
        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()
ans = sum(s!=t for s, t in zip(S, T))
print(ans)

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

Solution (Python):

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

count=0
for i in range(len(S)):
    if S[i] != T[i]:
        count+=1
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
from itertools import chain


def solve(S: str, T: str):
    answer = sum([s != t for s, t in zip(S, T)])
    return answer


def main():
    tokens = chain(*(line.split() for line in sys.stdin))
    S = next(tokens)  
    T = next(tokens)  
    answer = solve(S, T)
    print(answer)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
s=input()
t=input()
c=0
for x,y in zip(s,t):
  if x != y:
    c+=1
print(c)

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

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