ZS 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 $1 \rightarrow 2$, $2 \rightarrow 3$, $3 \rightarrow 1$ 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.

[Image]

Difficulty: HARD
Tags: Graph algorithms

Graph traversal

Combinatorics

Mathematics

Starter code:

Solutions:
def main():
	(n, m) = (int(input()), 1000000007)
	(aa, idx) = ([0, *map(int, input().split())], [0] * (n + 1))
	res = pos = 1
	for i in range(1, n + 1):
		if not idx[i]:
			(j, start) = (i, pos)
			while not idx[j]:
				idx[j] = pos
				pos += 1
				j = aa[j]
			if idx[j] >= start:
				n -= pos - idx[j]
				res = res * (pow(2, pos - idx[j], m) - 2) % m
	print(res * pow(2, n, m) % m)
main()


class Solution:

	def __init__(self):
		self.n = int(input())
		self.G = [int(x) for x in input().strip().split(' ')]
		self.G.insert(0, 0)
		self.used = [0 for i in range(self.n + 1)]
		self.dis = [0 for i in range(self.n + 1)]
		self.circle = []
		self.mod = 10 ** 9 + 7

	def solve(self):
		cur = 1
		for x in range(1, self.n + 1):
			if self.used[x] == 0:
				circle = self.dfs(x, 0, cur)
				if circle is not None:
					self.circle.append(circle)
				cur += 1
		self.sum = self.n
		self.ans = 1
		mod = self.mod
		for c in self.circle:
			self.ans *= (pow(2, c, mod) - 2) % self.mod
			self.sum -= c
		if self.sum == self.n:
			self.ans = pow(2, self.n, mod) - 2
		else:
			self.ans *= pow(2, self.sum, mod)
		self.ans %= self.mod
		return int(self.ans)

	def dfs(self, x, l, cur):
		while True:
			if self.used[x] != 0:
				if self.used[x] == cur:
					return l - self.dis[x]
				return None
			else:
				self.used[x] = cur
				self.dis[x] = l
				x = self.G[x]
				l += 1
s = Solution()
print(s.solve())


n = int(input())
A = list(map(int, input().split()))
V = [0 for _ in range(n)]
G = V[:]

def visiter(i, d):
	global V
	global G
	G[i] = d + 1
	V[i] = d + 1
	c = d + 2
	while 1:
		if V[A[i] - 1] and G[A[i] - 1] > d:
			return (1, c - G[A[i] - 1], G[A[i] - 1] - 1 - d, c)
		elif V[A[i] - 1]:
			return (0, 0, c - 1 - d, c)
		else:
			G[A[i] - 1] = c
			c += 1
			V[A[i] - 1] = 1
			i = A[i] - 1
T = [1 for _ in range(n + 1)]
for i in range(1, n + 1):
	T[i] = T[i - 1] * 2 % (10 ** 9 + 7)
R = []
d = 0
i = 0
c = 0
for i in range(n):
	if V[i] == 0:
		(v, l, s, c) = visiter(i, c)
		if v:
			R += [l]
		d += s
r = T[d]
for x in R:
	r = r * (T[x] - 2) % (10 ** 9 + 7)
print(r)


n = int(input())
l = list(map(int, input().split()))
l.insert(0, 0)
mark = {}
(loop, pos, res, mod) = (0, 1, 1, int(1000000000.0 + 7))
for i in range(1, n + 1):
	if not i in mark:
		(start, j) = (pos, i)
		while not j in mark:
			mark[j] = pos
			pos += 1
			j = l[j]
		if mark[j] >= start:
			size = pos - mark[j]
			loop += size
			res *= pow(2, size) - 2 + mod
			res %= mod
res = res * pow(2, n - loop, mod) % mod
print(res)


from sys import stdin
n = int(stdin.readline())
a = [int(x) - 1 for x in stdin.readline().split()]
nodes = set([x for x in range(n)])
loops = []
while nodes:
	for x in nodes:
		nxt = x
		break
	visited = set()
	q = []
	early = False
	while not nxt in visited:
		if not nxt in nodes:
			early = True
			break
		q.append(nxt)
		visited.add(nxt)
		nodes.remove(nxt)
		nxt = a[nxt]
	if not early:
		loops.append(len(q) - q.index(nxt))
base = pow(2, n - sum(loops), 10 ** 9 + 7)
for x in loops:
	base *= pow(2, x, 10 ** 9 + 7) - 2
	base %= 10 ** 9 + 7
print(base)