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.io.*;
import java.util.*;
public class working
{
    static PrintWriter out=new PrintWriter((System.out));
    public static void main(String args[])throws IOException
    {
        Reader sc=new Reader();
        
        int n=sc.nextInt();
        //ArrayList<Integer>[] adj=new ArrayList[n+1];
        //for(int i=0;i<=n;i++) adj[i]=new ArrayList<>();
        int[] par=new int[n+1];
        int[] rank=new int[n+1];
        for(int i=1;i<=n;i++) make_set(i,par,rank);
        for(int tt=1;tt<=n;tt++){
            int x=sc.nextInt();
            union_set(x,tt,par,rank);
           // out.println(Arrays.toString(par));
        }
        int count=0;
        boolean[] counted=new boolean[n+1];
        for(int i=1;i<=n;i++){
            int p=find_set(i,par);
            if(!counted[p]){
                counted[p]=true;
                count++;
            }
        }
        
        out.println(count); 
    	out.close();
 
    }
    private static void make_set(int v,int[] par,int[] rank){
        par[v]=v;
        rank[v]=0;
    }
    private static int find_set(int x,int[] par){
        if(par[x]==x) return x;
        return par[x]=find_set(par[x],par);
    }
    private static void union_set(int x,int y,int[] par,int[] rank){
        x=find_set(x,par);
        y=find_set(y,par);
        if(x==y) return;
        if(rank[x]<rank[y]) par[y]=x;
        else if(rank[x]>rank[y]) par[x]=y;
        if(rank[x]==rank[y]){
            par[y]=x;
            rank[x]++;
        }
    }
    private static void dfs(ArrayList<Integer>[] adj,int i,int par,boolean[] vis){
        
        for(int j:adj[i]){
            if(j==par) continue;
            if(!vis[j]){
                vis[j]=true;
                dfs(adj,j,i,vis);
            }
        }
    }
    
    // private static void dfs(ArrayList<Integer>[] adj,int i,int par,boolean[] vis){
    //     for(int j:adj[i]){
    //         if(j!=par){
    //             vis[j]=true;
    //             dfs(adj,j,i,vis);
    //         }
    //     }
    // }

    // private static boolean possible(char[][] grid,int i,int j){
    //     return (i>=0 && j>=0 && i<grid.length && j<grid[0].length);
    // }
    /*
    int n=sc.nextInt();
        	char[] s=sc.next().toCharArray();
        	int res=0;
        	for(int i=1;i<n;i++){
        		if( (s[i]=='1') && s[i]==s[i-1]) res++;
        	}
        	out.println(res);
    
    private static int modInverse(int a, int m) 
    { 
        a = a % m; 
        for (int x = 1; x < m; x++) 
           if ((a * x) % m == 1) 
              return x; 
        return 1;  
   }
    
    private static int gcd(int a,int b){
    	if(b==0) return a;
    	return gcd(b,a%b);
    }
    
    private static int dfs(ArrayList<Integer>[] adj,int[] arr,int i,int par){
    	if(adj[i].size()==0) return arr[i];
    	int curr=arr[i],s=adj[i].size();
    	int max=0;
        for(int j:adj[i]){
        	if(j==par) continue;
        	int temp=dfs(adj,arr,j,i);
        	max=Math.max(max,temp);
        	curr+=temp;
        }
        int rem=curr%s;
        if(rem>0) rem=1;
        int ans=rem+curr/s;
        if(max>ans) return max;
        return ans;
    }
     */
    public static long pow(long a,long b){
        if(b==0){
            return 1;
        }
        if(b%2==0){
            return pow(a*a,b/2);
        }else{
            return a*pow(a*a,b/2);
        }
    }
    static class Reader 
    { 
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        public String next()
        {
            while(!st.hasMoreTokens())
            {
                try
                {
                    st=new StringTokenizer(br.readLine());
                }
                catch(Exception e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        public int nextInt()
        {
            return Integer.parseInt(next());
        }
        public long nextLong()
        {
            return Long.parseLong(next());
        }
        public double nextDouble()
        {
            return Double.parseDouble(next());
        }
        public String nextLine()
        {
            try
            {
                return br.readLine();
            }
            catch(Exception e)
            {
                e.printStackTrace();
            }
            return null;
        }
        public boolean hasNext()
        {
            String next=null;
            try
            {
                next=br.readLine();
            }
            catch(Exception e)
            {
            }
            if(next==null)
            {
                return false;
            }
            st=new StringTokenizer(next);
            return true;
        }
    } 
}