#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 <limits>
#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> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
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; }
#define COLOR(s) ("\x1b[" s "m")


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::push(T &l, T &r)  should push the lazy update.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreeRange {
  int logN, n;
  vector<T> ts;
  SegmentTreeRange() : logN(0), n(0) {}
  explicit SegmentTreeRange(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreeRange(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void push(int u) {
    ts[u].push(ts[u << 1], ts[u << 1 | 1]);
  }
  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Applies T::f(args...) to [a, b).
  template <class F, class... Args>
  void ch(int a, int b, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return;
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) (ts[aa++].*f)(args...);
      if (bb & 1) (ts[--bb].*f)(args...);
    }
    for (int h = 1; h <= logN; ++h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) pull(aa);
      } else {
        if ((aa << h) != a) pull(aa);
        if ((bb << h) != b) pull(bb);
      }
    }
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    for (int h = logN; h; --h) {
      const int aa = a >> h, bb = b >> h;
      if (aa == bb) {
        if ((aa << h) != a || (bb << h) != b) push(aa);
      } else {
        if ((aa << h) != a) push(aa);
        if ((bb << h) != b) push(bb);
      }
    }
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (int h = logN; h; --h) push(a >> h);
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          push(a);
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (int h = logN; h; --h) push((b - 1) >> h);
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          push(b - 1);
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

using Value = int;
constexpr Value INF = 1001001001;

struct NodeCountMin {
  Value mn, lz;
  int cnt;
  NodeCountMin() : mn(INF), lz(0), cnt(0) {}
  NodeCountMin(Value val) : mn(val), lz(0), cnt(1) {}
  void push(NodeCountMin &l, NodeCountMin &r) {
    if (lz) {
      l.add(lz);
      r.add(lz);
      lz = 0;
    }
  }
  void pull(const NodeCountMin &l, const NodeCountMin &r) {
    if (l.mn < r.mn) {
      mn = l.mn;
      cnt = l.cnt;
    } else if (l.mn > r.mn) {
      mn = r.mn;
      cnt = r.cnt;
    } else {
      mn = l.mn;
      cnt = l.cnt + r.cnt;
    }
  }
  void add(Value val) {
    mn += val;
    lz += val;
  }
  // leaf
  void change(int val) {
    mn = val;
    cnt = 1;
  }
};

////////////////////////////////////////////////////////////////////////////////


int N;
vector<int> P[2];

// bidirectional
vector<vector<int>> graph[2];


namespace brute {
Int ans;
vector<int> on, deg;
int isol, leaf;
void add(int u) {
  on[u] = 1;
  ++isol;
  for (const int v : graph[1][u]) if (on[v]) {
    if (deg[u] == 0) { --isol; ++leaf; }
    if (deg[v] == 0) { --isol; ++leaf; }
    if (deg[u] == 1) --leaf;
    if (deg[v] == 1) --leaf;
    ++deg[u];
    ++deg[v];
  }
}
void rem(int u) {
  for (const int v : graph[1][u]) if (on[v]) {
    --deg[u];
    --deg[v];
    if (deg[u] == 1) ++leaf;
    if (deg[v] == 1) ++leaf;
    if (deg[u] == 0) { ++isol; --leaf; }
    if (deg[v] == 0) { ++isol; --leaf; }
  }
  --isol;
  on[u] = 0;
}
void dfs(int u, int p) {
  add(u);
  if (isol == 0 && leaf == 2) {
// cerr<<"  u = "<<u<<", on = "<<on<<", deg = "<<deg<<", isol = "<<isol<<", leaf = "<<leaf<<endl;
    ++ans;
  }
  for (const int v : graph[0][u]) if (p != v) {
    dfs(v, u);
  }
  rem(u);
}
Int run() {
cerr<<"[brute::run]"<<endl;
  ans = 0;
  on.assign(N, 0);
  deg.assign(N, 0);
  isol = leaf = 0;
  for (int u = 0; u < N; ++u) {
// cerr<<"root: "<<u<<endl;
    dfs(u, -1);
  }
  assert(ans % 2 == 0);
  ans /= 2;
  ans += N;
  return ans;
}
}  // brute


namespace sub2 {
int zeit;
vector<int> idss[2];
void dfs(int h, int u, int p) {
  idss[h][u] = zeit++;
  for (const int v : graph[h][u]) if (p != v) {
    dfs(h, v, u);
  }
}
Int run() {
cerr<<"[sub2::run]"<<endl;
  for (int h = 0; h < 2; ++h) {
    for (int u = 0; u < N; ++u) if (graph[h][u].size() <= 1) {
      zeit = 0;
      idss[h].assign(N, -1);
      dfs(h, u, -1);
      break;
    }
  }
  vector<int> perm(N, -1);
  for (int u = 0; u < N; ++u) {
    perm[idss[0][u]] = idss[1][u];
  }
// cerr<<"perm = "<<perm<<endl;
  SegmentTreeRange<NodeCountMin> seg(N);
  for (int i = 0; i < N; ++i) {
    seg.at(i) = NodeCountMin(i);
  }
  Int ans = 0;
  vector<pair<int, int>> stackMin, stackMax;
  stackMin.emplace_back(-INF, 0);
  stackMax.emplace_back(+INF, 0);
  for (int i = 0; i < N; ++i) {
    for (; stackMin.back().first > perm[i]; ) {
      const auto p = stackMin.back();
      stackMin.pop_back();
      seg.ch(stackMin.back().second, p.second, &NodeCountMin::add, +p.first);
    }
    seg.ch(stackMin.back().second, i + 1, &NodeCountMin::add, -perm[i]);
    stackMin.emplace_back(perm[i], i + 1);
    for (; stackMax.back().first < perm[i]; ) {
      const auto p = stackMax.back();
      stackMax.pop_back();
      seg.ch(stackMax.back().second, p.second, &NodeCountMin::add, -p.first);
    }
    seg.ch(stackMax.back().second, i + 1, &NodeCountMin::add, +perm[i]);
    stackMax.emplace_back(perm[i], i + 1);
    const auto res = seg.get(0, i + 1);
    if (res.mn <= i) {
      ans += res.cnt;
    }
  }
  return ans;
}
}  // sub2


int main() {
  for (; ~scanf("%d", &N); ) {
    for (int h = 0; h < 2; ++h) {
      P[h].assign(N, -1);
      for (int u = 1; u < N; ++u) {
        scanf("%d", &P[h][u]);
        --P[h][u];
      }
    }
    
    for (int h = 0; h < 2; ++h) {
      graph[h].assign(N, {});
      for (int u = 1; u < N; ++u) {
        graph[h][P[h][u]].push_back(u);
        graph[h][u].push_back(P[h][u]);
      }
    }
    
    int maxDeg = -1;
    for (int h = 0; h < 2; ++h) {
      for (int u = 0; u < N; ++u) {
        chmax(maxDeg, (int)graph[h][u].size());
      }
    }
    
    Int ans;
    if (maxDeg <= 2) {
      ans = sub2::run();
    } else if (N <= 5000) {
      ans = brute::run();
    } else {
      assert(false);
    }
    printf("%lld\n", ans);
#ifdef LOCAL
if(N<=5000){
 const Int brt=brute::run();
 if(brt!=ans)cerr<<"brt = "<<brt<<", ans = "<<ans<<endl;
 assert(brt==ans);
}
#endif
  }
  return 0;
}