public class QuickFindUF {

	private int[] id;
	
	public QuickFindUF(int N) {
		id = new int[N];
		for (int i=0; i<N; i++)
			id[i] = i;
	}
	
	public boolean connected(int p, int q) {
		return id[p] == id[q];
	}
	
	public void union(int p, int q) {
		int pid = id[p];
		int qid = id[q];
		for (int i=0; i<id.length; i++)
			if (id[i] == pid) id[i] = qid;
	}
	
	public static void main(String args[]) {
		QuickFindUF z = new QuickFindUF(10);
		z.union(3, 6);
		z.union(6, 0);
		z.union(4, 7);
		z.union(9, 7);
		z.union(4, 8);
		z.union(4, 0);
		
		for (int i=0; i<z.id.length; i++)
			StdOut.print(z.id[i] + " ");
		StdOut.println();
	}
}