n = int(input())
s = input()
t = input()

#SとTの一致しない文字数を数える
def count1(s: str, t: str) -> int:
    counter = 0
    
        
    return counter

#SとTに含まれる1の数の偶奇が異なる場合
def count2(s: str, t: str) -> int:
    counter = 0
    
    if (s.count("1") % 2 ) == (t.count("1") % 2 ):
        for i in range(len(s)):
            if  s[i] != t[i]:
                counter += 1
        
    elif (s.count("1") % 2 ) != (t.count("1") % 2):
        t = t[::-1]
        for j in range(len(s)):
            if  s[j] != t[j]:
                counter += 1
        
    return counter

def main():
    print(count2(s, t))

if __name__ == "__main__":
    main()