#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 5000 + 5;
int n, a, b, c, d;
int f[maxn];
int p[maxn];
vector<int> adj[maxn];
int size[maxn];
int g[maxn];
bitset<maxn> can[maxn];
int dfs(int u) {
  int res = f[u] ? u + 1 : 0;
  size[u] = !int((adj[u]).size());
  for (int i = (0); i < (int((adj[u]).size())); i++) {
    int v = adj[u][i];
    chkmax(res, dfs(v));
    size[u] += size[v];
  }
  return res;
}
void upd(bitset<maxn>& bt, vector<int> vsz) {
  for (int i = (0); i < (int((vsz).size())); i++) {
    bt |= bt << vsz[i];
  }
}
void solve() {
  cin >> n >> a >> b >> c >> d;
  a--, b--, c--, d--;
  f[a] = f[b] = f[c] = f[d] = 1;
  map<int, int> hs;
  hs[a] = 0, hs[b] = 1, hs[c] = 2, hs[d] = 3;
  for (int i = (1); i < (n); i++) {
    cin >> p[i], p[i]--;
    adj[p[i]].push_back(i);
  }
  int leaves = 0;
  for (int i = (0); i < (n); i++) leaves += !int((adj[i]).size());
  if (leaves & 1) {
    cout << "NO\n";
    return;
  }
  vector<int> vsz;
  for (int i = (0); i < (int((adj[0]).size())); i++) {
    int u = adj[0][i];
    int r = dfs(u);
    if (!r) {
      vsz.push_back(size[u]);
    } else {
      g[hs[r - 1]] = size[u];
    }
  }
  int ar[] = {a, b, c, d};
  for (int i = (0); i < (4); i++) {
    int u = ar[i];
    can[i][0] = 1;
    while (p[u]) {
      int v = p[u];
      vector<int> vsz;
      for (int j = (0); j < (int((adj[v]).size())); j++) {
        int w = adj[v][j];
        if (w != u) {
          vsz.push_back(size[w]);
        }
      }
      upd(can[i], vsz);
      u = v;
    }
  }
  bitset<maxn> exbt;
  exbt[0] = 1, upd(exbt, vsz);
  int tot = 0, dif = leaves / 2 - 1;
  for (int i = (0); i < (maxn); i++)
    for (int j = (0); j < (maxn); j++) {
      if (can[0][i] && can[1][j] && i + j + g[2] <= dif &&
          exbt[dif - i - j - g[2]]) {
        tot++;
        i = maxn - 1;
        break;
      }
    }
  for (int i = (0); i < (maxn); i++)
    for (int j = (0); j < (maxn); j++) {
      if (can[2][i] && can[3][j] && i + j + g[0] <= dif &&
          exbt[dif - i - j - g[0]]) {
        tot++;
        i = maxn - 1;
        break;
      }
    }
  if (tot == 2) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
}
int main() {
  int JUDGE_ONLINE = 1;
  if (fopen("in.txt", "r")) {
    JUDGE_ONLINE = 0;
    assert(freopen("in.txt", "r", stdin));
  } else {
    ios_base::sync_with_stdio(0), cin.tie(0);
  }
  solve();
  if (!JUDGE_ONLINE) {
  }
  return 0;
}
