#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in: v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e: t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

/**
 * @brief Xor-Shift
 * @docs docs/xor-shift.md
 */
struct XorShift {
private:
  constexpr static double R = 1.0 / 0xffffffff;
  uint64_t x;

public:
  explicit XorShift(uint64_t seed = 88172645463325252ull) : x(seed) {}

  template< typename T = uint64_t >
  inline T get() { // [0, 2^64)
    x ^= x << 7ull;
    x ^= x >> 9ull;
    return x;
  }

  inline uint32_t get(uint32_t r) { // [0, r)
    return ((uint64_t) get< uint32_t >() * r) >> 32ull;
  }

  inline uint32_t get(uint32_t l, uint32_t r) { // [l, r)
    return l + get(r - l);
  }

  inline double probability() { // [0.0, 1.0]
    return get< uint32_t >() * R;
  }
};

const int MAX_V = 4e5;
const int BACKET = 555;

int main() {
  int N;
  cin >> N;
  vector< int > A(N), B(N);
  cin >> A >> B;
  for(auto &a: A) --a;
  for(auto &a: B) --a;

  XorShift rng;
  vector< uint32_t > P(MAX_V);
  for(auto &p: P) p = rng.get< uint32_t >();
  vector< int > last_a(MAX_V, -1), last_b(MAX_V, -1);
  vector< uint32_t > sum(N);
  int ret = N;
  int64 all = 0;
  vector< unordered_map< uint32_t, int > > st((N + BACKET - 1) / BACKET);
  for(int j = 0; j < st.size(); j++) {
    int l = j * BACKET;
    int r = min(N, l + BACKET);
    st[j][0] = r - l;
  }
  vector< uint32_t > lazy((N + BACKET - 1) / BACKET);
  for(int i = 0; i < N; i++) {
    auto get = [&](const unordered_map< uint32_t, int > &mp, uint64_t x) {
      auto it = mp.find(x);
      return it == end(mp) ? 0 : it->second;
    };
    auto fix = [&](int a, int b, uint32_t p) {
      for(int j = 0; j <= i; j++) {
        int l = j * BACKET;
        int r = min(N, l + BACKET);
        if(a >= r or b <= l) {
        } else if(a <= l and r <= b) {
          ret -= get(st[j], lazy[j]);
          lazy[j] ^= p;
          ret += get(st[j], lazy[j]);
        } else {
          ret -= get(st[j], lazy[j]);
          st[j].clear();
          for(int k = max(l, a); k < min(r, b); k++) sum[k] ^= p;
          for(int k = l; k < r; k++) st[j][sum[k]]++;
          ret += get(st[j], lazy[j]);
        }
      }
    };
    fix(last_a[A[i]] + 1, i + 1, P[A[i]]);
    fix(last_b[B[i]] + 1, i + 1, P[B[i]]);
    last_a[A[i]] = i;
    last_b[B[i]] = i;
    all += ret - (N - i - 1);
  }
  cout << all << "\n";
}