Problem: There are n cities in the Kingdom of Autumn, numbered from 1 to n. People can travel between any two cities using n-1 two-directional roads.

This year, the government decides to separate the kingdom. There will be regions of different levels. The whole kingdom will be the region of level 1. Each region of i-th level should be separated into several (at least two) regions of i+1-th level, unless i-th level is the last level. Each city should belong to exactly one region of each level and for any two cities in the same region, it should be possible to travel between them passing the cities in the same region only.

According to research, for each city i, there is a value a_i, which describes the importance of this city. All regions of the same level should have an equal sum of city importances.

Your task is to find how many plans there are to determine the separation of the regions that all the conditions are satisfied. Two plans are considered different if and only if their numbers of levels are different or there exist two cities in the same region of one level in one plan but in different regions of this level in the other plan. Since the answer may be very large, output it modulo 10^9+7.

Input

The first line contains one integer n (1 ≤ n ≤ 10^6) — the number of the cities.

The second line contains n integers, the i-th of which is a_i (1 ≤ a_i ≤ 10^9) — the value of each city.

The third line contains n-1 integers, p_1, p_2, …, p_{n-1}; p_i (p_i ≤ i) describes a road between cities p_i and i+1.

Output

Print one integer — the number of different plans modulo 10^9+7.

Examples

Input

4
1 1 1 1
1 2 3


Output

4

Input

4
1 1 1 1
1 2 2


Output

2

Input

4
1 2 1 2
1 1 3


Output

3

Note

For the first example, there are 4 different plans:

Plan 1: Level-1: \{1,2,3,4\}.

Plan 2: Level-1: \{1,2,3,4\}, Level-2: \{1,2\},\{3,4\}.

Plan 3: Level-1: \{1,2,3,4\}, Level-2: \{1\},\{2\},\{3\},\{4\}.

Plan 4: Level-1: \{1,2,3,4\}, Level-2: \{1,2\},\{3,4\}, Level-3: \{1\},\{2\},\{3\},\{4\}.

For the second example, there are 2 different plans:

Plan 1: Level-1: \{1,2,3,4\}.

Plan 2: Level-1: \{1,2,3,4\}, Level-2: \{1\},\{2\},\{3\},\{4\}.

For the third example, there are 3 different plans:

Plan 1: Level-1: \{1,2,3,4\}.

Plan 2: Level-1: \{1,2,3,4\}, Level-2: \{1,2\},\{3,4\}.

Plan 3: Level-1: \{1,2,3,4\}, Level-2: \{1,3\},\{2\},\{4\}.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct edge {
  int y;
  edge* next;
};
edge* new_edge() {
  static edge a[1000005];
  static int top = 0;
  return &a[top++];
}
edge* li[1000005];
void insert_edge(int x, int y) {
  edge* t = new_edge();
  t->y = y;
  t->next = li[x];
  li[x] = t;
}
long long sums[1000005];
int a[1000005];
int o23k[1000005];
const int modo = 1000000007;
void dfs1(int x) {
  edge* t;
  sums[x] = a[x];
  for (t = li[x]; t != 0; t = t->next) {
    dfs1(t->y);
    sums[x] += sums[t->y];
  }
}
bool dfs(int x, long long k) {
  if (sums[x] < k) {
    return 0;
  }
  if (sums[x] == k) {
    return 0;
  }
  edge* t;
  long long rest = sums[x] % k;
  if (rest == 0) rest = k;
  rest -= a[x];
  for (t = li[x]; t != 0; t = t->next) {
    if (rest < 0) return 1;
    bool p = dfs(t->y, k);
    if (p) return 1;
    rest -= sums[t->y] % k;
  }
  if (rest < 0) {
    return 1;
  } else {
    return 0;
  }
}
int gcd(int x, int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int ans[1000005];
map<long long, int> ma;
int main() {
  int n;
  scanf("%d", &n);
  int i;
  long long sum = 0;
  int max_a = 0;
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    max_a = max(max_a, a[i]);
    sum += a[i];
  }
  int gcd_val = 0;
  for (i = 0; i < n; i++) {
    gcd_val = gcd(gcd_val, a[i]);
  }
  for (i = 0; i < n; i++) {
    a[i] /= gcd_val;
  }
  sum /= gcd_val;
  max_a /= gcd_val;
  for (i = 1; i < n; i++) {
    int x;
    scanf("%d", &x);
    x--;
    insert_edge(x, i);
  }
  int final_ans = 1;
  dfs1(0);
  int cnt = 0;
  ans[1] = 1;
  o23k[cnt++] = 1;
  sort(sums, sums + n);
  for (i = 0; i < n; i++) {
    ma[sums[i]]++;
  }
  for (i = 2; i <= n; i++) {
    if (sum % i == 0) {
      if ((sums[n - 1] % i != 0) && (sums[n - 1] > i)) {
        continue;
      }
      if (sum / i < max_a) {
        break;
      }
      int cnts = 0;
      long long p = sum / i;
      long long pp;
      for (pp = p; pp <= sum; pp += p) {
        cnts += ma[pp];
        if (cnts < pp / p) break;
      }
      if (cnts == i) {
        int j;
        for (j = 0; j < cnt; j++) {
          if (i % o23k[j] == 0) {
            ans[i] += ans[o23k[j]];
            ans[i] %= modo;
          }
        }
        o23k[cnt++] = i;
        final_ans = (final_ans + ans[i]) % modo;
      }
    }
  }
  printf("%d\n", final_ans);
  return 0;
}