import edu.princeton.cs.algs4.StdIn;

 import edu.princeton.cs.algs4.StdOut;

 public class FindLargestUF {

     private int[] id;

     private int count;

     public FindLargestUF(int n) {

         count = n;

         id = new int[n];

         for (int i = 0; i < n; i++)

             id[i] = i;

     }

     public int count(){

         return count;

     }

     public boolean connected(int p, int q){

         return (find(p)==find(q));

     }

     public int find(int p) {

         while (p != id[p])

             p = id[p];

         return p;

     }

     public void union(int p, int q) {

         int pRoot = find(p);

         int qRoot = find(q);

         StdOut.println("find("+p+")="+pRoot+",find("+q+")="+qRoot);

         if (pRoot == qRoot)

             return;

         else if (pRoot < qRoot)

             id[pRoot] = qRoot;

         else

             id[qRoot] = pRoot;

         count--;

     }

     public static void main(String[] args) {

         int n = StdIn.readInt();

         FindLargestUF uf = new FindLargestUF(n);

         while (!StdIn.isEmpty()) {

             int p = StdIn.readInt();

             int q = StdIn.readInt();

             if (uf.connected(p, q))

                 continue;

             uf.union(p, q);

             StdOut.println("link points:" + p + " " + q);

         }

         StdOut.println(uf.count() + "components");

     }

 }