Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Directed Roads

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputZS the Coder and Chris the Baboon has explored Udayland for quite some time. They realize that it consists of *n* towns numbered from 1 to *n*.

There are *n* directed roads in the Udayland. *i*-th of them goes from town *i* to some other town *a*_{i} (*a*_{i} ≠ *i*). ZS the Coder can flip the direction of any road in Udayland, i.e. if it goes from town *A* to town *B* before the flip, it will go from town *B* to town *A* after.

ZS the Coder considers the roads in the Udayland confusing, if there is a sequence of distinct towns *A*_{1}, *A*_{2}, ..., *A*_{k} (*k* > 1) such that for every 1 ≤ *i* < *k* there is a road from town *A*_{i} to town *A*_{i + 1} and another road from town *A*_{k} to town *A*_{1}. In other words, the roads are confusing if some of them form a directed cycle of some towns.

Now ZS the Coder wonders how many sets of roads (there are 2^{n} variants) in initial configuration can he choose to flip such that after flipping each road in the set exactly once, the resulting network will not 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^{5}) — the number of towns in Udayland.

The next line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ *n*, *a*_{i} ≠ *i*), *a*_{i} denotes a road going from town *i* 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 modulo 10^{9} + 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 and 3 roads. The towns are numbered from 1 to 3 and the roads are , , initially. Number the roads 1 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 towns 1, 2, 3 is form a directed cycle, so it is confusing. Similarly, flipping all roads is confusing too. Thus, there are a total of 6 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 is not confusing.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/20/2020 02:12:38 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|