#include <bits/stdc++.h>
using namespace std;
void scan(int &x) {
  bool neg = false;
  register int c;
  x = 0;
  c = getchar();
  if (c == '-') {
    neg = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) x = (x << 1) + (x << 3) + c - 48;
  if (neg) x *= -1;
}
int f1 = 0;
vector<vector<int> > gr(10009);
void dfs(int a) {
  int cnt = 0;
  if (gr[a].size() == 0) cnt = 3;
  for (int i : gr[a]) {
    dfs(i);
    if (gr[i].size() == 0) {
      cnt++;
    }
  }
  if (cnt < 3) f1 = 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int tmp;
    cin >> tmp;
    tmp--;
    gr[tmp].push_back(i);
  }
  dfs(0);
  if (f1 == 0)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}

### Prompt

Your task is to create a Cpp solution to the following problem:

Consider a rooted tree. A rooted tree has one special vertex called the root. All edges are directed from the root. Vertex u is called a child of vertex v and vertex v is called a parent of vertex u if there exists a directed edge from v to u. A vertex is called a leaf if it doesn't have children and has a parent.

Let's call a rooted tree a spruce if its every non-leaf vertex has at least 3 leaf children. You are given a rooted tree, check whether it's a spruce.

The definition of a rooted tree can be found [here](https://goo.gl/1dqvzz).

Input

The first line contains one integer n — the number of vertices in the tree (3 ≤ n ≤ 1 000). Each of the next n - 1 lines contains one integer pi (1 ≤ i ≤ n - 1) — the index of the parent of the i + 1-th vertex (1 ≤ pi ≤ i).

Vertex 1 is the root. It's guaranteed that the root has at least 2 children.

Output

Print "Yes" if the tree is a spruce and "No" otherwise.

Examples

Input

4
1
1
1


Output

Yes


Input

7
1
1
1
2
2
2


Output

No


Input

8
1
1
1
1
3
3
3


Output

Yes

Note

The first example:

<image>

The second example:

<image>

It is not a spruce, because the non-leaf vertex 1 has only 2 leaf children.

The third example:

<image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
void scan(int &x) {
  bool neg = false;
  register int c;
  x = 0;
  c = getchar();
  if (c == '-') {
    neg = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) x = (x << 1) + (x << 3) + c - 48;
  if (neg) x *= -1;
}
int f1 = 0;
vector<vector<int> > gr(10009);
void dfs(int a) {
  int cnt = 0;
  if (gr[a].size() == 0) cnt = 3;
  for (int i : gr[a]) {
    dfs(i);
    if (gr[i].size() == 0) {
      cnt++;
    }
  }
  if (cnt < 3) f1 = 1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int tmp;
    cin >> tmp;
    tmp--;
    gr[tmp].push_back(i);
  }
  dfs(0);
  if (f1 == 0)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}

```