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

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

a = len(s)
ans = 0

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

print(ans)

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy

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

if S == T:
    print(0)
else:
    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())

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

print(cnt)

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

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

import collections
import sys
import copy
import re


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


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

    cnt = 0

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

    print(cnt)


if __name__ == '__main__':
    main()

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

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

ans = 0

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

print(ans)

Solution (Python):
s = list(input())
t = list(input())
count = 0
for 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]:
      count = count+1

  print(count)

if __name__ == "__main__":
    main()

Solution (Python):

import sys

input = sys.stdin.readline


def S():
    return input().rstrip()


def I():
    return int(input())


def MI():
    return map(int, input().split())


s = S()
t = S()
n = len(s)

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

print(c)

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

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

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

print(len(S)-x)

Solution (Python):

import sys
input = sys.stdin.readline
s=list(input()) 
n=list(input())
ans = 0
for i in range(len(s)):
    if s[i]!=n[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 = 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()

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

print(ans)

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

Solution (Python):
s = input()
t = input()
l = int(len(s))
c = 0

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

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

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

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

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

def int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(map(int,input().split())))
    return np.array(x)

S = input()
T = input()

ans = 0

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

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

cnt = 0

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

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

print(r)

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

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

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

print(ans)

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))
ZIP = lambda: zip(*(MAP() for _ in range(n)))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


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

    print(cnt)

if __name__ == '__main__':
    main()

Solution (Python):



s = input()
t = input()
c = 0

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

print(c)

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

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

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

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

n = len(s)

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

print (str(r))

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

def read_int():
    l = sys.stdin.readline().rstrip('\n').split(' ')
    return int(l[0])

def read_int_list():
    l = sys.stdin.readline().rstrip('\n').split(' ')                                                  
    return [int(i) for i in l]


S = sys.stdin.readline()                                                                              
T = sys.stdin.readline()                                                                              

ans = 0

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

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

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

print(ans)

Solution (Python):
s = 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 = c + 1
    else:
        c = c

print(c)

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

    ans = 0

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

    print(ans)


resolve()

Solution (Python):

import sys


def solve(S: str, T: str):
    s = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            s+=1
    print(s)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    T = next(tokens)  
    solve(S, T)

if __name__ == '__main__':
    main()

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 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 not 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):
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()
count=0
for i,value in enumerate(S):
    if T[i]!=value:
        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):
import sys
import math
import numpy as np
import functools
import operator
import collections
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()

ans=0

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

print(ans)

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

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

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

print(n-counter)

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

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

print(c)

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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

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

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

Solution (Python):
import numpy as np




S = input()
T = input()




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


print(count)

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

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

df = 0

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

print(df)

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

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

print(cnt)

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

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

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

s=input().rstrip()
t=input().rstrip()

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

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

Solution (Python):
from collections import Counter

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

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

Solution (Python):
import sys
import math
import heapq
from collections import defaultdict, deque
input = sys.stdin.readline
def r():
    return int(input())
def rm():
    return map(int,input().split())
def rl():
    return list(map(int,input().split()))

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

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

print(count)

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

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

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

i=0
ans=0

while i<len(s):

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

    i+=1

print(ans)

Solution (Python):


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

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

    print(count)




if __name__ == '__main__':
    main()

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 bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys


buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


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

    return ans


def main():
    S = read_str()
    T = read_str()
    print(slv(S, T))


if __name__ == '__main__':
    main()

Solution (Python):
import sys
def input():
    return sys.stdin.readline().rstrip('\n')
    

def calc(S, T):
    n = 0
    for i in range(len(S)):
        if S[i] != T[i]:
            n += 1
    return n

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

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

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

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

Solution (Python):
S = input()
T = input()
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, char in enumerate(S):
    if char != T[i]:
        count += 1

print(count)

Solution (Python):



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


count = 0
s_len = len(S)


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


print(count)

Solution (Python):
import sys

def resolve():
    lines = sys.stdin.readlines()

    s = lines[0].strip()
    t = lines[1].strip()

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

    print(c)

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


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


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

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

Solution (Python):
import sys
import math as mt

t=1

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

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

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

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

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

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

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

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 I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    T=input()
    cnt=0
    for i in range(len(S)):
        if S[i]!=T[i]:
            cnt+=1
            
    print(cnt)

main()

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

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

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

print(ans)

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

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

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

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

print(a)

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

s = input().strip()
t = input().strip()

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
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+=1
print(ans)

Solution (Python):
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools
import fractions
import sys

a = stdin.readline().rstrip()
b = stdin.readline().rstrip()
count = 0
res = 0
for el in a:
    if b[count] != el:
        res += 1
    count += 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):
N=input()
M=input()
cnt=0
for i in range(len(N)):
    if N[i]!=M[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=str(input())
t=str(input())
ans=0
for i in range(len(s)):
  if s[i]!=t[i]:
    ans=ans+1
print(ans)

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

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

print(cnt)

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

print([S[i] != T[i] for i in range(len(S))].count(True))

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

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

Solution (Python):

import sys

from sys import stdin
input = lambda: stdin.readline().rstrip()


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

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

print(ans)

Solution (Python):


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

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

c = 0
for a1, a2 in zip(s, t):
    if a1 != a2:
        c += 1

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

import sys


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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    T = next(tokens)  
    solve(S, T)

if __name__ == '__main__':
    main()

Solution (Python):

def main():
    S = input()
    T = input()
    count = 0

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

    print(count)


if __name__ == '__main__':
    main()

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

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

print(count)

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

Solution (Python):
S = input()

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

print(counter)

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

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

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

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

Solution (Python):
def main():
    s = input().strip()
    t = input().strip()
    cnt = 0
    for (a,b) in zip(list(s), list(t)):
        if a!=b:
            cnt += 1

    print(cnt)

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

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

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