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;
const double PI = 3.14159265358979323846264338327950288419716939937510;
const double E = 2.7182818284590452353602874713526624977572470936999596;
const double eps = 0.000000001;
const int MOD = 1e9 + 7;
inline int max(int u, int v) { return u > v ? u : v; }
inline int min(int u, int v) { return u < v ? u : v; }
inline long long gcd(long long u, long long v) { return v ? gcd(v, u % v) : u; }
template <typename T>
inline void read(T& u) {
  char id;
  u = 0;
  bool used = 0;
  id = getchar();
  while (id > '9' || id < '0') {
    if (id == '-') used = 1;
    id = getchar();
  }
  while ((id <= '9' && id >= '0')) {
    u = u * 10 + id - '0';
    id = getchar();
  }
  if (used) u *= -1;
}
template <typename T>
inline void read(T& u, T& v) {
  read(u);
  read(v);
}
template <typename T>
inline void read(T& u, T& v, T& tmp) {
  read(u);
  read(v);
  read(tmp);
}
int val[3000100], cnt[3000100], fa[3000100];
long long dp[3000100] = {0, 1}, siz[3000100];
vector<int> mapp[3000100];
long long sum;
void dfs(int u, int n) {
  siz[u] = val[u];
  for (int i = ((int)mapp[u].size() - 1); (i) >= (0); (i)--) {
    dfs(mapp[u][i], n);
    siz[u] += siz[mapp[u][i]];
  }
  long long tmp = sum / gcd(sum, siz[u]);
  if (tmp <= n) cnt[tmp]++;
}
int main() {
  int n;
  read(n);
  for (int i = (1); (i) <= (n); (i)++) {
    read(val[i]);
    sum += val[i];
  }
  for (int i = (2); (i) <= (n); (i)++) {
    read(fa[i]);
    mapp[fa[i]].push_back(i);
  }
  dfs(1, n);
  for (int i = (n); (i) >= (1); (i)--)
    for (int j = i << 1; j <= n; j += i) cnt[j] += cnt[i];
  for (int i = (1); (i) <= (n); (i)++)
    if (dp[i])
      for (int j = i << 1; j <= n; j += i)
        if (cnt[j] == j) dp[j] = (dp[j] + dp[i]) % MOD;
  long long ans = 0;
  for (int i = (1); (i) <= (n); (i)++) ans = (ans + dp[i]) % MOD;
  cout << ans << endl;
  return 0;
}