//
// An example of the channeling constraint
//
import choco.Problem;
import choco.integer.*;
import choco.Solver;
import choco.Solution;
import choco.search.*;
import choco.util.*;

public class Magic {

    public static void main(String[] args) throws Exception {
	int n = Integer.parseInt(args[0]);
	Problem pb = new Problem();
	IntDomainVar v[] = new IntDomainVar[n];
	IntDomainVar w[] = new IntDomainVar[n];

	for (int i=0;i<n;i++){
	    v[i] = pb.makeEnumIntVar("v[" + i + "]",0,n-1);
	    w[i] = pb.makeEnumIntVar("w[" + i + "]",0,n-1);
	}

	pb.post(pb.inverseChanneling(v,w));

	v[0].remVal(3);
	v[5].setVal(7);
	pb.propagate();
	//System.out.println(pb.pretty());
	for (int i=0;i<n;i++) System.out.println(v[i].pretty());
	System.out.println("----------------------------------------");
	for (int i=0;i<n;i++) System.out.println(w[i].pretty());

	System.out.println(v[3].getDomain());

	System.out.println(v[3].getDomain().getIterator().hasNext());

	//IntDomain  d = w[3].getDomain();
	IntIterator x = w[3].getDomain().getIterator();
	while (x.hasNext()) System.out.println(x.next());
    }
}