import time
import sys
#sys.setrecursionlimit(500000)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def TI(): return tuple(map(int,sys.stdin.readline().rstrip().split()))
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())
#for i, pi in enumerate(p):
from collections import defaultdict,deque
import bisect
import itertools
dic = defaultdict(int)
d = deque()
N = I()
S = LS()
T = LS()
ans = 0
ans1 = 0
for i in range(N):
  if S[i] != T[i]:
    ans += 1
S.reverse()
for i in range(N):
  if S[i] != T[i]:
    ans1 += 1
answer = float('inf')
if ans % 2 == 0:
  answer = min(ans,answer)
if ans % 2 == 1:
  answer = min(ans1,answer)
print(answer)