//
// Given an instance, is there a partion +/- 1?
//
import java.io.*;
import java.util.*;
import org.chocosolver.solver.Model;
import org.chocosolver.solver.Solver;
import org.chocosolver.solver.variables.IntVar;
import org.chocosolver.solver.search.strategy.Search;

public class Decision {

  
  public static void main(String[] args) throws IOException {
      Scanner sc    = new Scanner(new File(args[0]));
      int n         = sc.nextInt(); // number of numbers
      Model model   = new Model("number partitioning");
      Solver solver = model.getSolver();
      IntVar[] D    = model.intVarArray("D",n,0,1); // decision ... left or right?
      int[] w       = new int[n]; // weights
      int total     = 0; // sum of weights

      for (int i=0;i<n;i++){
		w[i]  = sc.nextInt();
		total = total + w[i];
      }
      sc.close();
      
      model.scalar(D,w,"=",total/2).post();
      //solver.limitTime(10000); // how? that's how
      solver.setSearch(Search.minDomUBSearch(D)); // take 1 then 0
      
      boolean solved = solver.solve();
      System.out.print(solved);
      System.out.println("  nodes: "+ solver.getMeasures().getNodeCount());
  }
}