You are give two rooted tree with n vertices. For each tree, every vertex has a distinct integer label in [1,n]. You want to change the label of vertices in , and make two trees identical. After Two trees are identical iff
- The labels of their roots are the same.
- For a non-root vertices with label u, the labels of their parent should also be the same.
After the modification, the label of should also be a permutation of .

The first line contains an integer . Each of the following two lines contains n integers .  means the label of the parent of the vertex with label i. If , it's the root of the tree.
It's guaranteed that you can change the label of  to make two trees identical.

Output one integer, the number of vertices whose labels are changed.

3
0 1 1
3 3 0

2