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

Solution (Python):
S,T = open(0).read().split()
s = list(S)
t = list(T)
ans = 0
for a, b in zip(s, t):
    if a != b:
        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())
c = 0
for i in range(len(s)):
    if s[i] != t[i]:
        c += 1
print(c)

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

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

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

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

Solution (Python):
s=input()
t=input()
count=0
for ss,tt in zip(s,t):
    if ss==tt:
        continue
    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()
res = 0
for a,b in zip(s,t):
  if a !=b:
    res += 1
print(res)

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

t = str(input())

a = 0
n = len(s)

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

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

print(answer)

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)

r = 0

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

print(r)

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

Solution (Python):


S = str(input())
T = str(input())

count = 0

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

print("{}".format(count))

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

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

Solution (Python):
def main():
    s = list(input())
    t = list(input())
    cnt = 0
    for idx, i in enumerate(s):
        if i != t[idx]:
            cnt += 1
    print(cnt)
    
if __name__ == '__main__':
    main()

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

Solution (Python):
S = [s for s in input()]
T = [t for t in input()]

count = sum([
  s != t
  for s, t in zip(S, T)
])
print(count)

Solution (Python):
import os

str = input()
str2 = input()

count = 0

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

print(count)

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

cnt=0

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

print(cnt)

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

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

Solution (Python):
if __name__ == "__main__":
    S = list(input())
    T = list(input())
    count = 0
    for i, s in enumerate(S):
        if T[i] != s:
            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()
cnt = 0

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

print(cnt)

Solution (Python):
a = list(input())
b = list(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 += 1

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

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

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

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

print(ans)

Solution (Python):
k = list(input())
l = list(input())
count = 0
for i in range(len(k)):
  if k[i] != l[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 = str(input())
T = str(input())
c = 0
for i in range(0, 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+=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 = str(input())
t = str(input())

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

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 numpy as np
import sys
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 += 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()
counter = 0
for i, j in enumerate(s):
    if j != t[i]:
        counter += 1
print(counter)

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

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

main()

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()
S_list = list(S)
T = input()
T_list = list(T)
count = 0
if(S==T):
  print("0")
  exit()
for i in range(len(S_list)):
  if(S_list[i]!=T_list[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 = list(input())
b_list = list(input())
cnt = 0

for a,b in zip(a_list,b_list):
    if a == b:
        continue
    else:
        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(len(s)-cnt)

Solution (Python):
s1 = input()
s2 = input()
count = 0
for i in range(len(s1)):
  if s1[i] != s2[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]:
        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()

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

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

count = 0

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

print(count)

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

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

Solution (Python):
import math
from collections import Counter










  
    
    
  
    

S = list(input()) 
T = list(input()) 
cnt = 0

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

print(cnt)

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

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

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

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

Solution (Python):
import sys, io, os, re
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor, ceil
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce
from itertools import groupby
from heapq import heapify, heappush, heappop



n1 = lambda: int(sys.stdin.readline().strip())
nn = lambda: list(map(int, sys.stdin.readline().strip().split()))
f1 = lambda: float(sys.stdin.readline().strip())
fn = lambda: list(map(float, sys.stdin.readline().strip().split()))
s1 = lambda: sys.stdin.readline().strip()
sn = lambda: list(sys.stdin.readline().strip().split())
nl = lambda n: [n1() for _ in range(n)]
fl = lambda n: [f1() for _ in range(n)]
sl = lambda n: [s1() for _ in range(n)]
nm = lambda n: [nn() for _ in range(n)]
fm = lambda n: [fn() for _ in range(n)]
sm = lambda n: [sn() for _ in range(n)]

def array1(n, d=0): return [d] * n
def array2(n, m, d=0): return [[d] * m for x in range(n)]
def array3(n, m, l, d=0): return [[[d] * l for y in xrange(m)] for x in xrange(n)]
def linc(A, d=1): return map(lambda x: x + d, A)
def ldec(A, d=1): return map(lambda x: x - d, A)

S = s1()
T = s1()

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

Solution (Python):
s,t = [input()for _ in range(2)]

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

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

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

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

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

import sys
input = sys.stdin.readline
S =input().strip()
T =input().strip()
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()
count = 0
for i in range(len(a)):
    if a[i] != b[i]:
        count += 1
print(count)

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

import math
import itertools

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

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

result = 0

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

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

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

print(ans)

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

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

print(count)

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

count = 0
for c1, c2 in zip(s,t):
    if c1 is not c2: count += 1

print(count)

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

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

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

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 s, s1 in zip(S, T):
    if s != s1:
        cnt = 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):









import os
import sys




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


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

total = 0

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

print(total)

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

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


print(count)

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

cntSame = 0
l = len(s)
for idx in range(l):
    if s[idx] == t[idx]:
        cntSame += 1

ans = l - cntSame
print(ans)

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

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

print(n)

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

N=len(S)

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

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

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

print(cnt)

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

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

import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit


ipt = stdin.readline
setrecursionlimit(10**7)

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

    return

if __name__ == '__main__':
    main()

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

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

if __name__ == "__main__":
    main()

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

    print([s[i] == t[i] for i in range(len(s))].count(False))


if __name__ == '__main__':
    main()

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

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

result = 0
for s, t in zip(S, T):
    result += s != t
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):
if __name__ == '__main__':
    S = input().strip()
    T = input().strip()

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

    print(count)

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

print(sum)

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

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

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

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

Solution (Python):
S = input()
T = input()
wrong_count = 0
for i in range(len(S)):
  if S[i] != T[i]:
    wrong_count += 1
print(str(wrong_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())
a = 0
for i, _ in enumerate(s):
    if s[i] != t[i]:
        a = a+1
print(a)

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

cnt = 0
for i, sv in enumerate(s):
    if t[i] != sv:
        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):
import sys
S=sys.stdin.readline().strip()
T=sys.stdin.readline().strip()
ans=0
for x,y in zip(S,T):
    if x!=y:
        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]:
        pass
    else:
        ans+=1

print(ans)

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

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

Solution (Python):

"""
@author: H_Hoshigi
"""
def main():
    S = input()
    T = input()

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

if __name__ == "__main__":
    main()

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 = list(input())
T = list(input())
cnt = 0
for k, v in zip(S, T):
    if not k == v:
        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('')

c=0
b=0
for a in s:
    if a!=t[b]:
        c=c+1
    b=b+1

print(c)

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

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

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

print(ans)

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

lens = len(S)

cnt=0

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

print(cnt)

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

ans = 0
for s_i, t_i in zip(s, t):
  if not s_i == t_i:
    ans += 1
print(ans)

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

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

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

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

Solution (Python):
def resolve():
    import sys
    input = sys.stdin.readline
    
    S = input().strip()
    T = input().strip()

    
    
    
    
    
    
    
    

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

    print(cnt)


resolve()

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

Solution (Python):
from sys import stdin
input = stdin.readline
s = input().rstrip()
t = input().rstrip()
ans = 0
for i in range(len(s)):
    if s[i]!=t[i]:
        ans+=1
print(ans)

Solution (Python):
import numpy as np
S = np.array(list(input()))
T = np.array(list(input()))

ans = np.sum(S != T)

print(ans)

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

ans=0

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

print(ans)

Solution (Python):
import sys
import numpy as np
import math
import collections
from collections import deque 
from functools import reduce



s = input()
t = input()

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

Solution (Python):
s = str(input())
t = str(input())
ans = 0
count = 0
for i in s:
    if i != t[count]:
        ans += 1
    count += 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()

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

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

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

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


print(result)

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

Solution (Python):
def main():
    N1 = str(input())
    N2 = str(input())

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

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

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

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

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

    count = 0
    for x, y in zip(s, t):
        if not x == y:
            count += 1

    print(count)


if 'unittest' not in globals():
    resolve()

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

count=0

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

print(count)

Solution (Python):
def main():
    import sys
    def input():
        return sys.stdin.readline()[:-1]
    S=input()
    T=input()
    a=len(S)
    n=0
    for i in range(a):
        if S[i]!=T[i]:
            n+=1
    print(n)
if __name__ == '__main__':
    main()

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):
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()
def hamming_dist(str1,str2):
    ans = 0
    a,b = len(str1),len(str2)
    if a > b:
        ans = a - b
        length = b
    elif a < b:
        ans = b - a
        length = a
    else:
        length = a
    for i in range(length):
        if str1[i] != str2[i]:
            ans += 1
    return ans
print(hamming_dist(s,t))

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

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

Solution (Python):
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

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

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

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

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

Solution (Python):
def readinput():
    s=input()
    t=input()
    return s,t

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

if __name__=='__main__':
    s,t=readinput()
    ans=main(s,t)
    print(ans)

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

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

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

Solution (Python):
S = str(input())
T = str(input())
cnt=0
for sl,tl in zip(S,T):
    if sl != tl:
        cnt +=1
    
print(cnt)

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

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

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

print( sum([i != j for i, j in zip(s,t)]) )

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

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

print(cnt)

Solution (Python):
import copy

def main():
    S = str(input())
    T = str(input())

    c = 0

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

    print(c)

main()