import types
import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x

class LazySegTree:
    def __init__(
            self,
            v: typing.Union[int, typing.List[typing.Any]]) -> None:

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [0] * (2 * self._size)
        self._lz = [0] * (2 * self._size)
        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)


    def all_prod(self) -> typing.Any:
        return self._d[1]

    def apply(self, left: int, right: typing.Optional[int] = None,
              f: typing.Optional[typing.Any] = None) -> None:
        assert f is not None

        if right is None:
            p = left
            assert 0 <= left < self._n

            p += self._size
            self._d[p] += f
            for i in range(1, self._log + 1):
                self._update(p >> i)
        else:
            assert 0 <= left <= right <= self._n
            if left == right:
                return

            left += self._size
            right += self._size

            l2 = left
            r2 = right
            while left < right:
                if left & 1:
                    self._all_apply(left, f)
                    left += 1
                if right & 1:
                    right -= 1
                    self._all_apply(right, f)
                left >>= 1
                right >>= 1
            left = l2
            right = r2

            for i in range(1, self._log + 1):
                if ((left >> i) << i) != left:
                    self._update(left >> i)
                if ((right >> i) << i) != right:
                    self._update((right - 1) >> i)

    def _all_apply(self, k: int, f: typing.Any) -> None:
        self._lz[k] += f
        if k < self._size:
          self._update(k)
        else:
          self._d[k] = (1 if self._lz[k] == 0 else 0)
    def _update(self, k: int) -> None:
        self._d[k] = self._d[2 * k] + self._d[2 * k + 1]
        if self._lz[k] > 0:
          self._d[k] = 0



n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
init = [1] * n
init.append(0)
seg = LazySegTree(init)
sz = 400005;
pre_a = [-1] * sz
pre_b = [-1] * sz;
ans = 0;
for i in range(n):
  upd = [];
  upd.append(a[i]);
  if a[i] != b[i]:
    upd.append(b[i]);
  for val in upd:
    l = min(pre_a[val], pre_b[val]);
    r = max(pre_a[val], pre_b[val]);
    seg.apply(l + 1, r + 1, -1);
  pre_a[a[i]] = i;
  pre_b[b[i]] = i;
  for val in upd:
    l = min(pre_a[val], pre_b[val]);
    r = max(pre_a[val], pre_b[val]);
    seg.apply(l + 1, r + 1, 1);
  ans += seg.all_prod() - (n - i - 1);
print(ans)