import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import math
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
from collections import defaultdict
from collections import deque
#import copy #DeepCopy: hoge = [_[:] for _ in hogehoge]
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
dx = [1,0,-1,0]
dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    N = int(input()); INF = 1 << 60
    S = list(str(input()))
    S = [int(a) for a in S]
    T = list(str(input()))
    T = [int(a) for a in T]
    ans = INF
    #偶数回で一致するときに必要な変更箇所
    en = 0
    for s,t in zip(S,T):
        if s != t:
            en += 1
    #奇数回で一致するときに必要な変更箇所
    on = 0
    for i in range(N):
        if S[i] != T[N-1-i]:
            on += 1
    if en%2 == 0:
        ans = min(ans,en)
    if on%2 == 1:
        ans = min(ans,on)
    print(ans)

if __name__ == '__main__':
    main()