import static choco.Choco.*;
import choco.cp.model.CPModel;
import choco.cp.solver.CPSolver;
import choco.cp.solver.search.integer.varselector.StaticVarOrder;
import choco.kernel.model.Model;
import choco.kernel.solver.Solver;
import choco.kernel.model.variables.integer.IntegerVariable;
import choco.kernel.solver.variables.integer.IntDomainVar;

public class SteinerTriple03 {    
  
  public static void main(String[] args) {

      CPModel model = new CPModel();
      int m = Integer.parseInt(args[0]); 
      int n = m*(m-1)/6;

      IntegerVariable[][] block = makeIntVarArray("block",n,m,0,1); // block[i][j] = 1 <-> j is in ith block    
      IntegerVariable[][] pair  = new IntegerVariable[m][m];        // pair[i][j] = k <-> (i,j) is in block[k]

      for (int i=0;i<m-1;i++)
	  for (int j=i+1;j<m;j++)
	      pair[i][j] = makeIntVar("pair_"+ i +"_"+ j,0,n-1);
      //
      // one variable for each pair (i,j) where i<j
      //	      

      for (int i=0;i<n;i++)
	  model.addConstraint(eq(sum(block[i]),3));
      //
      // there are 3 points in a block
      //

      for (int i=0;i<m-1;i++)
	  for (int j=i+1;j<m;j++)
	      for (int k=0;k<n;k++)
		  model.addConstraint(ifOnlyIf(eq(pair[i][j],k),and(eq(block[k][i],1),eq(block[k][j],1))));
      //
      // pair[i][j] = k <-> block[k][i] = 1 && block[k][j] = 1
      //

      CPSolver sol = new CPSolver();
      sol.read(model);

      IntDomainVar[] decision = new IntDomainVar[m*(m-1)/2];
      for (int i=0,k=0;i<m-1;i++)
	  for (int j=i+1;j<m;j++,k++)
	      decision[k] = sol.getVar(pair[i][j]);
      sol.setVarIntSelector(new StaticVarOrder(decision));
      //
      // decision variables are the pairs
      //

      System.out.println(sol.solve());
      sol.printRuntimeSatistics();
      for (int i=0;i<n;i++){
	  for (int j=0;j<m;j++)
	      if(sol.getVar(block[i][j]).getVal() == 1) System.out.print(j +" ");
	  for (int j=0;j<m;j++)
	      System.out.print(sol.getVar(block[i][j]).getVal());
	  System.out.println();
      }
  }
}