#include <bits/stdc++.h>
using namespace std;
typedef long long int ll ;
ll dp[500000+5];
int b[500000+5];
int a[500000+5];
void DFS(int node,vector <int> G[],int used[],int parent[]){
used[node] = 1 ;
for(auto u: G[node]){ //iterating all children "u" of "node"
if(used[u]==0){
//if this node/branch has never been visited before
//just go into it and search it using dfs in recursion
parent[u] = node ;
DFS(u,G,used,parent);
}
}
//print(node)--->parent
//----> bottom up traversal
ll s = 0 ;
for(auto child: G[node]){
if(child==parent[node]){
//it means the child node is parent of the node
//it is not the child
//ignore it
}
else{
s = s + dp[child];
}
}
dp[node] = s + 1;
}
int main(){
int n ;
cin>>n ;
vector <int> G[n+1];
int i = 1 ;
while(i<=n){
cin>>a[i] ;
i++;
}
i = 1 ;
while(i<=n){
cin>>b[i] ;
i++;
}
i = 1 ;
while(i<=n){
int u,v;
u = a[i],v = b[i];
G[u].push_back(v);
G[v].push_back(u);
i++;
}
int used[n+1] = {0};
int parent[n+1] = {0};
DFS(0,G,used,parent); //starts from node 1
ll answer = 0;
i = 1;
while(i <= n){
answer += (dp[i] + 4) / 5; // ceil division
i++;
}
cout<<(answer);
return 0 ;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGludCBsbCA7IApsbCBkcFs1MDAwMDArNV07CmludCBiWzUwMDAwMCs1XTsKaW50IGFbNTAwMDAwKzVdOwp2b2lkIERGUyhpbnQgbm9kZSx2ZWN0b3IgPGludD4gR1tdLGludCB1c2VkW10saW50IHBhcmVudFtdKXsKICAgIAogICAgdXNlZFtub2RlXSA9IDEgOyAKICAgIAogICAgZm9yKGF1dG8gdTogR1tub2RlXSl7IC8vaXRlcmF0aW5nIGFsbCBjaGlsZHJlbiAidSIgb2YgIm5vZGUiCiAgICAgICAgCiAgICAgICAgaWYodXNlZFt1XT09MCl7CiAgICAgICAgICAgIC8vaWYgdGhpcyBub2RlL2JyYW5jaCBoYXMgbmV2ZXIgYmVlbiB2aXNpdGVkIGJlZm9yZSAKICAgICAgICAgICAgLy9qdXN0IGdvIGludG8gaXQgYW5kIHNlYXJjaCBpdCB1c2luZyBkZnMgaW4gcmVjdXJzaW9uCiAgICAgICAgICAgIHBhcmVudFt1XSA9IG5vZGUgOyAKICAgICAgICAgICAgREZTKHUsRyx1c2VkLHBhcmVudCk7CiAgICAgICAgICAgIAogICAgICAgIH0KICAgIH0KICAgIAogICAgCiAgICAvL3ByaW50KG5vZGUpLS0tPnBhcmVudAogICAgLy8tLS0tPiBib3R0b20gdXAgdHJhdmVyc2FsIAogICAgbGwgcyA9IDAgOyAKICAgIGZvcihhdXRvIGNoaWxkOiBHW25vZGVdKXsKICAgICAgICAKICAgICAgICBpZihjaGlsZD09cGFyZW50W25vZGVdKXsKICAgICAgICAgICAgLy9pdCBtZWFucyB0aGUgY2hpbGQgbm9kZSBpcyBwYXJlbnQgb2YgdGhlIG5vZGUKICAgICAgICAgICAgLy9pdCBpcyBub3QgdGhlIGNoaWxkCiAgICAgICAgICAgIC8vaWdub3JlIGl0CiAgICAgICAgfQogICAgICAgIAogICAgICAgIGVsc2V7CiAgICAgICAgICAgIHMgPSBzICsgZHBbY2hpbGRdOyAKICAgICAgICB9CiAgICB9CiAgICBkcFtub2RlXSA9IHMgKyAxOyAKICAgIAogICAgCn0KCmludCBtYWluKCl7CiAgICBpbnQgbiA7IAogICAgY2luPj5uIDsgCiAgICB2ZWN0b3IgPGludD4gR1tuKzFdOwogICAgaW50IGkgPSAxIDsgCiAgICB3aGlsZShpPD1uKXsKICAgICAgICBjaW4+PmFbaV0gOyAKICAgICAgICBpKys7CiAgICB9CiAgICAKICAgIGkgPSAxIDsgCiAgICB3aGlsZShpPD1uKXsKICAgICAgICBjaW4+PmJbaV0gOyAKICAgICAgICBpKys7CiAgICB9CiAgICAKICAgIGkgPSAxIDsgCiAgICB3aGlsZShpPD1uKXsKICAgICAgICBpbnQgdSx2OwogICAgICAgIHUgPSBhW2ldLHYgPSBiW2ldOyAKICAgICAgICBHW3VdLnB1c2hfYmFjayh2KTsKICAgICAgICBHW3ZdLnB1c2hfYmFjayh1KTsgCiAgICAgICAgaSsrOwogICAgfQogICAgaW50IHVzZWRbbisxXSA9IHswfTsKICAgIGludCBwYXJlbnRbbisxXSA9IHswfTsKICAgIERGUygwLEcsdXNlZCxwYXJlbnQpOyAvL3N0YXJ0cyBmcm9tIG5vZGUgMSAgCiAgICAKICAgIGxsIGFuc3dlciA9IDA7ICAgIAogICAgaSA9IDE7CiAgICB3aGlsZShpIDw9IG4pewogICAgCWFuc3dlciArPSAoZHBbaV0gKyA0KSAvIDU7IC8vIGNlaWwgZGl2aXNpb24KICAgIAlpKys7CiAgICB9CgogICAgY291dDw8KGFuc3dlcik7IAogICAgcmV0dXJuIDAgOyAKfQoK