from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = inpl()
b = inpl()
f = False
res = 0
for i in range(n):
    if not f and a[i] != b[i]:
        f = True
    elif f and a[i] == b[i]:
        f = False
        res += 1
if f: res += 1
print(res)