#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


template <class T> void bAdd(vector<T> &bit, int pos, const T &val) {
  const int bitN = bit.size();
  for (int x = pos; x < bitN; x |= x + 1) bit[x] += val;
}
template <class T> T bSum(const vector<T> &bit, int pos) {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) ret += bit[x];
  return ret;
}
template <class T> T bSum(const vector<T> &bit, int pos0, int pos1) {
  return bSum(bit, pos1) - bSum(bit, pos0);
}


constexpr int MAX = 400'010;

int N;
vector<int> A, B;

Int ans;

int lsA[MAX], lsB[MAX], rsA[MAX], rsB[MAX];
bool onA[MAX], onB[MAX];

void solve(int l, int r) {
  if (r - l == 1) {
    if (A[l] == B[l]) {
      ++ans;
    }
  } else {
    const int mid = (l + r) / 2;
    solve(l, mid);
    solve(mid, r);
    
// cerr<<"solve "<<l<<" "<<mid<<" "<<r<<endl;
    const int X = mid - l, Y = r - mid;
    for (int i = l; i < r; ++i) {
      lsA[A[i]] = lsA[B[i]] = lsB[A[i]] = lsB[B[i]] = X + 1;
      rsA[A[i]] = rsA[B[i]] = rsB[A[i]] = rsB[B[i]] = Y + 1;
    }
    for (int i = l; i < mid; ++i) {
      lsA[A[i]] = lsB[B[i]] = mid - i;
    }
    for (int i = r; --i >= mid; ) {
      rsA[A[i]] = rsB[B[i]] = i + 1 - mid;
    }
// cerr<<"  lsA = ";pv(lsA,lsA+10);
// cerr<<"  lsB = ";pv(lsB,lsB+10);
// cerr<<"  rsA = ";pv(rsA,rsA+10);
// cerr<<"  rsB = ";pv(rsB,rsB+10);
    
    vector<int> ps(X + 1, 0), qs(Y + 1, 0);
    {
      for (int i = l; i < mid; ++i) {
        onA[A[i]] = onA[B[i]] = onB[A[i]] = onB[B[i]] = false;
      }
      multiset<int> mxs;
      mxs.insert(1);
      for (int i = mid; --i >= l; ) {
        if (!onA[A[i]]) {
          if (onB[A[i]]) {
            mxs.erase(mxs.find(rsA[A[i]]));
          } else {
            mxs.insert(rsB[A[i]]);
          }
          onA[A[i]] = true;
        }
        if (!onB[B[i]]) {
          if (onA[B[i]]) {
            mxs.erase(mxs.find(rsB[B[i]]));
          } else {
            mxs.insert(rsA[B[i]]);
          }
          onB[B[i]] = true;
        }
        ps[mid - i] = *mxs.rbegin();
      }
    }
    {
      for (int i = mid; i < r; ++i) {
        onA[A[i]] = onA[B[i]] = onB[A[i]] = onB[B[i]] = false;
      }
      multiset<int> mxs;
      mxs.insert(1);
      for (int i = mid; i < r; ++i) {
        if (!onA[A[i]]) {
          if (onB[A[i]]) {
            mxs.erase(mxs.find(lsA[A[i]]));
          } else {
            mxs.insert(lsB[A[i]]);
          }
          onA[A[i]] = true;
        }
        if (!onB[B[i]]) {
          if (onA[B[i]]) {
            mxs.erase(mxs.find(lsB[B[i]]));
          } else {
            mxs.insert(lsA[B[i]]);
          }
          onB[B[i]] = true;
        }
        qs[i - mid + 1] = *mxs.rbegin();
      }
    }
// cerr<<"  ps = ";pv(ps.begin(),ps.end());
// cerr<<"  qs = ";pv(qs.begin(),qs.end());
    
    /*
      (x, y)
      y >= ps[x]
      x >= qs[y]
    */
    vector<vector<int>> xss(Y + 1);
    for (int x = 1; x <= X; ++x) {
      if (ps[x] <= Y) {
        xss[ps[x]].push_back(x);
      }
    }
    vector<int> bit(X + 1, 0);
    for (int y = Y; y >= 1; --y) {
      if (qs[y] <= X) {
        bAdd(bit, qs[y], 1);
      }
      for (const int x : xss[y]) {
        ans += bSum(bit, x + 1);
      }
    }
  }
}

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N); for (int i = 0; i < N; ++i) scanf("%d", &A[i]);
    B.resize(N); for (int i = 0; i < N; ++i) scanf("%d", &B[i]);
    
    ans = 0;
    solve(0, N);
    printf("%lld\n", ans);
  }
  return 0;
}