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

data = input()
data1 = input()

cnt = 0
for i in range(0, len(data)):
    if data[i] != data1[i]:
        cnt += 1

print(cnt)

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


if __name__ == '__main__':
    main()

Solution (Python):
list1 = list(input())
list2 = list(input())

times = 0

for index, alpha in enumerate(list1):
    if list2[index] == alpha:
        pass
    else:
        list1[index] == list2[index]
        times += 1
print(times)

Solution (Python):
S = input()
T = 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()
ans = 0
for i, ch in enumerate(S):
  if ch != 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

print(len(S) - count)

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

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

print(len([0 for s, t in zip(S, T) if 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):
S = input()
T = input()

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

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

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

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

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 in range(len(s)):
  if not (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()
print(sum(1 for a,b in zip(s,t) if a!=b))

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

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

print(ans)

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

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

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

print(ans)

Solution (Python):
S = input().strip()
T = input().strip()
 
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 s,t in zip(S,T):
  if s != t:
    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()
A = len(S)
s = 0
for i in range(A):
  if S[i-1] != T[i-1]:
    s += 1

print(s)

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

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

Solution (Python):

import sys


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




main()

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

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

print(number)

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()
ans = 0
for a, b in zip(s, t):
    if a != b:
        ans += 1
print(ans)

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

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

print(cnt)

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

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

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

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

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

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

S = ''.join(S)
T = ''.join(T)

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

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

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

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

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

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

print(cnt)

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

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

print(q)

Solution (Python):



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


str_len = len(S)
count = 0


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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy



from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    s = list(input())
    t = list(input())
    n = len(s)
    cnt = 0
    for i in range(n):
        if s[i] != t[i]:
            cnt += 1
    print(cnt)
        
if __name__ == "__main__":
    main()

Solution (Python):
S=input()

T=input()

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

print(ans)

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

c=0

for i in range(len(a)):

  if a[i]==b[i]:
    c+=0

  else:
    c+=1

print(c)

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

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

print(count)

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

S_l = len(S)
T_l = len(T)
cnt = 0

for i in range(S_l):
    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(len(s)-count)

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

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

print(counter)

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

c=0

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

print(c)

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

sum = 0

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

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

Solution (Python):
cnt = 0
for s, t in zip(list(input()), list(input())):
    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 = str(input())
t = str(input())


count = 0


l = len(s)


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

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

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

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

print(a)

Solution (Python):
s=str(input())
p=str(input())
c=0
for i in range(len(s)):
  if s[i]!=p[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()

count = 0
l = len(s)

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

print(count)

Solution (Python):
ss1 = input()
ss2 = input()

count = 0
for s1, s2 in zip(ss1, ss2):
    if s1 != s2:
        count += 1

print(count)

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

print(ans)

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

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):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq


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)
c=0
for i in range(n):
    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+=1

print(count)

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

asize = len(a[0])
count = 0
for i in range(asize):
    if a[0][i] == a[1][i]:
        continue
    else:
        count += 1
        
print(str(count))

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

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

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

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

Solution (Python):

import math
import collections
import bisect
from difflib import SequenceMatcher


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

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

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

list=list(zip(S,T))

c=0
for i in list:
    if i[0]!=i[1]:
        c+=1    
print(c)

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

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

ans = 0
for char_s, char_t in zip(s, t):
    if char_s != char_t:
        ans += 1

print(ans)

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

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

print(cnt)

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

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

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

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

count = 0

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

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

r = 0

for idx, ss in enumerate(s):
    if (ss != t[idx]):
        r = r + 1

print(r)

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

r = 0

for idx, ss in enumerate(s):
    if (ss != t[idx]):
        r = r + 1

print(r)

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

i = 0
count = 0

while i < len(S):
    if S[i] is not T[i]:
        count = count + 1
    i = i + 1

print(count)

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

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

if __name__ == "__main__":
    s = input()
    t = input()
    print(count(s,t))

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

print(len(list(filter(lambda i : S[i] != T[i], range(len(S))))))

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

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

x = 0
i = 0
while i < len(S):
    if S[i] != T[i]:
        x += 1
    i+=1

print(x)

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

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

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

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

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

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

print(cnt)

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

Solution (Python):
S = input()
T = input()
A = [char for char in S]
B = [char for char in T]
count = 0
for i in range(len(A)):
  if A[i]!=B[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):
count = 0
a = input()
b = input()

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

print(count)

Solution (Python):


def resolve():
    import sys
    input = sys.stdin.readline
    s = input().rstrip()
    t = input().rstrip()

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

    print(result)

if __name__ == "__main__":
    resolve()

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


if __name__=="__main__":
  main()

Solution (Python):
def resolve():
    ans = 0

    s = input()
    t = input()
    l = len(s)

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

    print(ans)


if __name__ == "__main__":
    resolve()

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

Sum = 0

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

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

Solution (Python):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline



def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    s, t = gete(), gete()

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

Solution (Python):
if __name__ == "__main__":
    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()
ans = 0

for s, t in zip(S, T):
    if s != t: 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):
a = input()
b = input()

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

print(count)

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

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

print(o)

Solution (Python):



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


if __name__ == "__main__":
    main()

Solution (Python):
aaa=input()
bbb=input()
ll=len(aaa)
x=0
for i in range(ll):
    aa=aaa[i]
    bb=bbb[i]
    
    if aa!=bb:
        x+=1

print(x)

Solution (Python):
A = list(map(str,input()))
B = list(map(str,input()))
count = 0
for i in range(len(A)):
    if A[i]!=B[i]:
        count+=1

print(count)

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

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 count_diff(q,a):
    lst_q = list(q)
    lst_a = list(a)
    len_q = len(lst_q)
    ng = 0
    for i in range(len_q):
        if lst_q[i] != lst_a[i]:
            ng += 1
    print(ng)

q =input()
a =input()

count_diff(q,a)

Solution (Python):
s=input()
t=input()
ans=0
n=len(s)
for i in range(n):
    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 += 0
    else:
        ans += 1
print(ans)

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

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

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

ans=0
for a,b in zip(A,B):
    if a!=b:
        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, t = input(), input()

x = list(filter(lambda i:s[i] != t[i], range(len(s)) ))

print(len(x))

Solution (Python):
import math

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

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

l = list(a)
m = list(b)

k = 0
for i in range(len(l)):
    if (l[i] != m[i]):
        k += 1

print(k)

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

count = 0

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

print(count)

Solution (Python):
l = [input() for _ in range(2)]
i=0
for a in range(len(l[0])):
    if l[0][a]!=l[1][a]:
        i=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):
s = input()
t = input()
ans = 0
for i, j in zip(s, t):
    if i != j:
        ans += 1
print(ans)

Solution (Python):
word1 = list(input())
word2 = list(input())
i = 0
for p, q in zip(word1, word2):
	if p!=q:
		i+=1
print(i)

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

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

print(count)

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

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

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

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

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

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

Solution (Python):
s_string = input()
t_string = input()

num = 0

for s_char, t_char in zip(s_string, t_string):
    if s_char != t_char:
        num = num + 1

print(num)

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

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

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

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

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

print(count)

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
input=sys.stdin.readline

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

if __name__=='__main__':
  main()

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

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

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

print(ans)

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

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

print(cnt)

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

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

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

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

S_list = list(S)
T_list = list(T)

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

print(count)

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

cnt = 0
for i in range(len(a)):
    if a[i] != b[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()

out = 0
for i in range(len(s)):
    out += int(not s[i] == t[i])
print(out)

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

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

diff = 0

for t in range(len(T)):
  if T[t] is not S[t]:
    diff += 1

print(diff)

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):
import numpy as np 
S = input()
T = input()

print(sum(np.array(list(S)) != np.array(list(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()
print(sum(1 for c1, c2 in zip(S, T) if c1 != c2))

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, T = (input() for _ in range(2))
ans = 0

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

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

count = 0

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


print(count)

Solution (Python):



def compare(S, T):
    s = t = 0
    changes = 0

    while s < len(S):
        if S[s] != T[t]:
            changes += 1
        s += 1
        t += 1

    return changes


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

Solution (Python):
ans = 0
x = input()
y = input()

for i in range(len(x)):
    if x == y:
        break
    else:
        if x[i] != y[i]:
            ans += 1
print(ans)

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):
from math import *
def main():
    
    s = input()
    t = input()
    ans=0
    for c in range(len(s)):
        if s[c] != t[c]:
            ans += 1
    print(ans)
main()

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