codeforces 711D. Directed Roads 找环

D. Directed Roads

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

ZS the Coder and Chris the Baboon has explored Udayland for quite some time. They realize that it consists ofn towns numbered from1 ton.

There are n directed roads in the Udayland.i-th of them goes from towni to some other towna_i (a_i ≠ i). ZS the Coder can flip the direction of any road in Udayland, i.e. if it goes from townA to townB before the flip, it will go from townB to townA after.

ZS the Coder considers the roads in the Udayland confusing, if there is a sequence of distinct towns A₁, A₂, ..., A_k (k > 1) such that for every1 ≤ i < k there is a road from townA_i to townA_i + 1 and another road from townA_k to townA₁. In other words, the roads are confusing ifsome of them form a directed cycle of some towns.

Now ZS the Coder wonders how many sets of roads (there are 2ⁿ variants) in initial configuration can he choose to flip such that after flipping each road in the set exactly once, the resulting network willnot be confusing.

Note that it is allowed that after the flipping there are more than one directed road from some town and possibly some towns with no roads leading out of it, or multiple roads between any pair of cities.

Input

The first line of the input contains single integer n (2 ≤ n ≤ 2·10⁵) — the number of towns in Udayland.

The next line contains n integers a₁, a₂, ..., a_n(1 ≤ a_i ≤ n, a_i ≠ i),a_i denotes a road going from towni to town a_i.

Output

Print a single integer — the number of ways to flip some set of the roads so that the resulting whole set of all roads is not confusing. Since this number may be too large, print the answer modulo10⁹ + 7.

Examples

Input

3
2 3 1

Output

6

Input

4
2 1 1 1

Output

8

Input

5
2 4 2 5 3

Output

28

Note

Consider the first sample case. There are 3 towns and3 roads. The towns are numbered from1 to3 and the roads are,, initially. Number the roads1 to 3 in this order.

The sets of roads that ZS the Coder can flip (to make them not confusing) are {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}. Note that the empty set is invalid because if no roads are flipped, then towns1, 2, 3 is form a directed cycle, so it is confusing. Similarly, flipping all roads is confusing too. Thus, there are a total of6 possible sets ZS the Coder can flip.

The sample image shows all possible ways of orienting the roads from the first sample such that the network isnot confusing.

题意：给一个图，n个点n条边，每条边可以反方向，问有多少种方案使得图中没有环。

解法，只需要找出图中的环，任意改变（大于等于1小于n条）多少条边，都可以使得一个环不是环。一个环的方案数就是C(1,n)+C(2,n)+C(3,n)+...C(n-1,n)，这个组合数的和为2的n次方减2.把每个环的方案数求出来乘起来就行了。剩余不是环的边可以随便取不取，再乘一个2的剩余边的次方就行了。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5+10;
const LL mod = 1e9+7;
int n;
int a[N];  
int vis[N];
LL cnt;
LL ans;
int deps[N]; ///深度，用于记录一个环有多少条边

LL Pow(LL a,LL b,LL mod)
{
    LL ret = 1;
    LL A = a;
    while(b){
        if(b&1) ret = A*ret%mod;
        A = A*A%mod;
        b >>= 1;
    }
    return ret;
}

void dfs(int u,int dep,int fa)
{
    vis[u] = fa;  ///相同分量设置为同一个标记
    deps[u] = dep;
    if(!vis[a[u]]) dfs(a[u],dep+1,fa);
    else{
        if(vis[a[u]] == vis[u]){
            ans = ans*(Pow(2,deps[u]-deps[a[u]]+1,mod)-2)%mod;
            cnt += deps[u]-deps[a[u]]+1;
        }
    }
}

int main(void)
{
    int n;
    ans = 1;
    scanf("%d",&n);
    for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
    for(int i = 1;i <= n;i++){
        if(!vis[i]){
            dfs(i,1,i);
        }
    }
    ans = ans*(Pow(2,n-cnt,mod))%mod;
    printf("%I64d",ans);
    return 0;
}