import choco.Problem;
import choco.Constraint;
import choco.Solver;
import choco.Solution;
import choco.ContradictionException;
import choco.integer.*;
import choco.integer.search.DecreasingDomain;
import choco.search.*;
import choco.search.AbstractGlobalSearchSolver;
import choco.search.AbstractGlobalSearchLimit;
import choco.integer.search.*;
import java.io.*;
import java.lang.*;
import java.util.*;

public class GreedyBuild {	
   

    public static void main(String[] args) throws Exception,ContradictionException,FileNotFoundException,IOException {
	long ms1 = System.currentTimeMillis();
	Dict d = new Dict();
	MyIo fin = new MyIo(args[0]);
	int n = fin.getNextInt();
	Tree t[] = new Tree[n];
	for (int i=0;i<n;i++) t[i] = new Tree(fin.getNextString(),d);
	
	fin.close();

	Problem pb = new Problem();
	int m = d.size();

	UMatrix um = new UMatrix(m-1,pb,d,false);	
	
	for (int i=0;i<n;i++) t[i].softBreakUp(um);

	//System.out.println("blip1");


	IntDomainVar D[] = um.getOptVars();
	int nCon = um.numbConstraints();
	Solver s = pb.getSolver();
	s.setVarSelector(new VarOrder(D)); 
	s.setValIterator(new DecreasingDomain());

	long ms2 = System.currentTimeMillis();	
	boolean solved = pb.solve(false);
	long ms3 = System.currentTimeMillis();

	if (solved){
	    Tree t3 = um.toTree();
	    System.out.println(t3);
	}
	else
	    System.out.println("();");

	int rejected = 0;
	ArrayList A = um.getTriples();
	for (int i=0;i<A.size();i++){
	    Triple tr = (Triple)A.get(i);
	    IntDomainVar v = tr.getVar();
	    if (v.getVal() == 0) rejected++;
	}


	System.out.println("model: " + (ms2-ms1) + "ms   " + "solve: " + (ms3-ms2) + "ms" );
	AbstractGlobalSearchLimit S = (AbstractGlobalSearchLimit)s.getSearchSolver().limits.get(1);
	int nds = S.getNbTot();
	System.out.println("nodes: " + nds + " constraints: " + nCon + "  species: " + m + " rejected: " + rejected);
    }
}