Problem: PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices and k - 1 edges, where k is some integer. Note that one vertex is a valid tree.

There is exactly one relative living in each vertex of each tree, they have unique ids from 1 to n. For each Ball i we know the id of its most distant relative living on the same tree. If there are several such vertices, we only know the value of the one with smallest id among those.

How many trees are there in the forest?

Input

The first line contains single integer n (1 ≤ n ≤ 104) — the number of Balls living in the forest.

The second line contains a sequence p1, p2, ..., pn of length n, where (1 ≤ pi ≤ n) holds and pi denotes the most distant from Ball i relative living on the same tree. If there are several most distant relatives living on the same tree, pi is the id of one with the smallest id.

It's guaranteed that the sequence p corresponds to some valid forest.

Hacking: To hack someone, you should provide a correct forest as a test. The sequence p will be calculated according to the forest and given to the solution you try to hack as input. Use the following format:

In the first line, output the integer n (1 ≤ n ≤ 104) — the number of Balls and the integer m (0 ≤ m < n) — the total number of edges in the forest. Then m lines should follow. The i-th of them should contain two integers ai and bi and represent an edge between vertices in which relatives ai and bi live. For example, the first sample is written as follows:
    
    
      
    5 3  
    1 2  
    3 4  
    4 5  
    

Output

You should output the number of trees in the forest where PolandBall lives.

Interaction

From the technical side, this problem is interactive. However, it should not affect you (except hacking) since there is no interaction.

Examples

Input

5
2 1 5 3 3

Output

2

Input

1
1


Output

1

Note

In the first sample testcase, possible forest is: 1-2 3-4-5. 

There are 2 trees overall.

In the second sample testcase, the only possible graph is one vertex and no edges. Therefore, there is only one tree.

Solution (in JAVA):

Solution:

	
	import java.util.*;

	
	//optimized version of http://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm
	public class SCCTarjan {
	
	List<Integer>[] graph;
	boolean[] visited;
	Stack<Integer> stack;
	int time;
	int[] lowlink;
	List<List<Integer>> components;
	
	public List<List<Integer>> scc(List<Integer>[] graph) {
	 int n = graph.length;
	 this.graph = graph;
	 visited = new boolean[n];
	 stack = new Stack<>();
	 time = 0;
	 lowlink = new int[n];
	 components = new ArrayList<>();
	
	 for (int u = 0; u < n; u++)
	   if (!visited[u])
	     dfs(u);
	
	 return components;
	}
	
	void dfs(int u) {
	 lowlink[u] = time++;
	 visited[u] = true;
	 stack.add(u);
	 boolean isComponentRoot = true;
	
	 for (int v : graph[u]) {
	   if (!visited[v])
	     dfs(v);
	   if (lowlink[u] > lowlink[v]) {
	     lowlink[u] = lowlink[v];
	     isComponentRoot = false;
	   }
	 }
	
	 if (isComponentRoot) {
	   List<Integer> component = new ArrayList<>();
	   while (true) {
	     int x = stack.pop();
	     component.add(x);
	     lowlink[x] = Integer.MAX_VALUE;
	     if (x == u)
	       break;
	   }
	   components.add(component);
	 }
	}
	
	// Usage example
	public static void main(String[] args) {
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		List<Integer>[] g = new List[n];
		 for (int j = 0; j < g.length; j++)
		   g[j] = new ArrayList<>();
		 for(int i=0;i<n;i++){
			int x=s.nextInt()-1;
			g[i].add(x);
			g[x].add(i);
			 
		 }
		 List<List<Integer>> components = new SCCTarjan().scc(g);
		 System.out.println(components.size());
	}
	}