#include <bits/stdc++.h>
using namespace std;
template <class T, class S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
  return os << "(" << v.first << ", " << v.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "[";
  for (int i = int(0); i <= int((static_cast<int>((v).size())) - 1); ++i) {
    if (i) os << ", ";
    os << v[i];
  }
  return os << "]";
}
template <class T>
bool setmax(T& _a, T _b) {
  if (_a < _b) {
    _a = _b;
    return true;
  }
  return false;
}
template <class T>
bool setmin(T& _a, T _b) {
  if (_b < _a) {
    _a = _b;
    return true;
  }
  return false;
}
template <class T>
T gcd(T _a, T _b) {
  return _b == 0 ? _a : gcd(_b, _a % _b);
}
int desired_gap = 0;
bool check(int sa, int sb, int sc, vector<int> ss) {
  bitset<2501> b;
  if (sc < static_cast<int>((b).size())) b[sc] = 1;
  for (int s : ss) b |= b << s;
  for (int i = int(0); i <= int(desired_gap); ++i)
    if (b[i]) {
      int extra = desired_gap - i;
      if (sa - 1 + sb - 1 >= extra) return true;
    }
  return false;
}
bool solve(int sa, int sc, int sb, int sd, vector<int> ss) {
  return check(sa, sb, sc, ss) && check(sc, sd, sb, ss);
}
int main() {
  int n;
  scanf("%d", &n);
  int a, b, c, d;
  scanf("%d%d%d%d", &a, &b, &c, &d);
  --a, --b, --c, --d;
  vector<vector<int> > children(n);
  for (int i = int(1); i <= int(n - 1); ++i) {
    int j;
    scanf("%d", &j);
    --j;
    children[j].push_back(i);
  }
  int sa, sb, sc, sd;
  vector<int> ss;
  const function<pair<int, int>(int)> dfs = [&](int x) {
    if (static_cast<int>((children[x]).size()) == 0) {
      return make_pair(1, x == a || x == b || x == c || x == d ? x : -1);
    }
    int s = 0, p = -1;
    for (int y : children[x]) {
      pair<int, int> r = dfs(y);
      s += r.first, setmax(p, r.second);
    }
    return make_pair(s, p);
  };
  int sum = 0;
  for (int x : children[0]) {
    pair<int, int> r = dfs(x);
    sum += r.first;
    if (r.second == a) {
      sa = r.first;
    } else if (r.second == b) {
      sb = r.first;
    } else if (r.second == c) {
      sc = r.first;
    } else if (r.second == d) {
      sd = r.first;
    } else {
      ss.push_back(r.first);
    }
  }
  bool ans;
  if (sum % 2 == 0) {
    desired_gap = sum / 2 - 1;
    ans = solve(sa, sc, sb, sd, ss) || solve(sa, sd, sb, sc, ss);
  } else {
    ans = false;
  }
  printf("%s\n", ans ? "YES" : "NO");
  return 0;
}
