Codeforces Round #393 (Div. 2) - C. Pavel and barbecue

C. Pavel and barbecue

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Pavel cooks barbecue. There are n skewers, they lay on a brazier in a row, each on one of n positions. Pavel wants each skewer to be cooked some time in every of n positions in two directions: in the one it was directed originally and in the reversed direction.

Pavel has a plan: a permutation p and a sequence b1, b2, ..., bn, consisting of zeros and ones. Each second Pavel move skewer on position i to position pi, and if bi equals 1 then he reverses it. So he hope that every skewer will visit every position in both directions.

Unfortunately, not every pair of permutation p and sequence b suits Pavel. What is the minimum total number of elements in the given permutation p and the given sequence b he needs to change so that every skewer will visit each of 2n placements? Note that after changing the permutation should remain a permutation as well.

There is no problem for Pavel, if some skewer visits some of the placements several times before he ends to cook. In other words, a permutation p and a sequence b suit him if there is an integer k (k ≥ 2n), so that after k seconds each skewer visits each of the 2nplacements.

It can be shown that some suitable pair of permutation p and sequence b exists for any n.

Input

The first line contain the integer n (1 ≤ n ≤ 2·105) — the number of skewers.

The second line contains a sequence of integers p1, p2, ..., pn (1 ≤ pi ≤ n) — the permutation, according to which Pavel wants to move the skewers.

The third line contains a sequence b1, b2, ..., bn consisting of zeros and ones, according to which Pavel wants to reverse the skewers.

Output

Print single integer — the minimum total number of elements in the given permutation p and the given sequence b he needs to change so that every skewer will visit each of 2n placements.

Examples

input

4
4 3 2 1
0 1 1 1

output

2

input

3
2 3 1
0 0 0

output

1

Note

In the first example Pavel can change the permutation to 4, 3, 1, 2.

In the second example Pavel can change any element of b to 1.

题意：

给你两个队列，a，b。a[i]代表第i个位置的串要放到第a[i]个位置。b[i]代表第i个位置的串去放的时候翻不翻面。

要让所有位置的串都正反在n个位置都烤一遍。

给你的队列可能不满足条件，让你更换队列里的一些数字，求最小变化数字的次数。

POINT：

即要让a队列变成一个环，b队列变成单数就行。

a怎么变成环：

把a[i]跑的路径都变成一条一条的。然后条数首位相连。变化次数就是条数。

注意如果a[i]只需跑一次，那么也要特判。判断他是否是真环，还是只是【单纯都走过了一遍】（即再次走的时候走不到某些点）。比如（6），看形状。

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <iostream>
#include <math.h>
#include <map>
using namespace std;
#define LL long long
const int maxn = 2e5+44;
int a[maxn];
int flag[maxn];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    int num=0;
    for(int i=1;i<=n;i++){
        int b;scanf("%d",&b);
        if(b&1) num++;
    }
    int ans=0;
    if(num%2==0) ans++;
    num=0;
    for(int i=1;i<=n;i++){
        int now=i;
        if(flag[now]==0)    num++;
        while(flag[now]==0){
             flag[now]=1;
            now=a[now];

        }
    }
    int f[maxn];
    memset(f,0,sizeof f);
    if(num==1){
        int now=1;
        int p=0;
        while(now){
            now=a[now];
            if(now==1){
                printf("%d\n",ans);
                return 0;
            }
            p++;
            if(p>n+44) break;
        }
    }
    printf("%d\n",ans+num);

    return 0;
}