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

public class FBuild {	
   

    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].breakUp(um);

	long ms2 = System.currentTimeMillis();

	boolean solved = true;
	try {pb.propagate();}
	catch (Exception e) {solved = false;}

	//Solver sol = pb.getSolver();
	//boolean solved = pb.solve(false);

	long ms3 = System.currentTimeMillis();

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

	System.out.println("model: " + (ms2-ms1) + "ms   " + "solve: " + (ms3-ms2) + "ms" );

	/*
	if (pb.solve(false)) {
	    Tree t3 = um.toTree();
	    System.out.println(t3);	
	    //System.out.println(um);
	    //System.out.println(d);
	    //um.showTriples();
	}

	Solver s = pb.getSolver();
	AbstractGlobalSearchLimit S = (AbstractGlobalSearchLimit)s.getSearchSolver().limits.get(0);
	int time = S.getNbTot();
	S = (AbstractGlobalSearchLimit)s.getSearchSolver().limits.get(1);
	int nds = S.getNbTot();

	System.out.println(" time: " + time + " nodes: " + nds);
	*/

    }
}