import java.util.LinkedList;

public class step1 {
	static LinkedList<node> array[];
	static LinkedList<node> remain;
	static int nOfBits = 0;

	static String Binary(int decimal) {
		array = new LinkedList[nOfBits + 1];
		StringBuilder conc = new StringBuilder();
		String bin = Integer.toBinaryString(decimal);
		int count = 0;
		for (int i = 0; i < bin.length(); i++) {
			if (bin.charAt(i) == '1') {
				count++;
			}
		}
		for (int i = 0; i < nOfBits - bin.length(); i++) {
			conc.append("0");
		}
		conc.append(bin);
		node new_node = new node(2 ^ nOfBits - 1);
		new_node.minterm = conc.toString();
		new_node.min[decimal] = true;
		new_node.symbol.append(Integer.toString(decimal)).append(',');
		array[count].add(new_node);
		return conc.toString();
	}

	public void solve(LinkedList<node> tmp[]) {
		LinkedList<node> tmpnext[] = new LinkedList[tmp.length + 1];
		int i = 0;
		while (i < tmp.length - 1) {
			for (int j = 0; j < tmp[i].size(); j++) {
				for (int k = 0; k < tmp[i + 1].size(); k++) {
					int count = 0;
					StringBuilder newminterm = new StringBuilder();
					for (int l = 0; l < nOfBits; l++) {

						if (tmp[i].get(j).minterm.charAt(l) == tmp[i].get(k).minterm.charAt(l)) {
							newminterm.append(tmp[i].get(j).minterm.charAt(l));
							continue;

						} else {
							count++;
							newminterm.append('-');
							if (count > 0)
								break;

						}
					}
					if (count == 1) {
						node new_node = new node(nOfBits);
						new_node.minterm = newminterm.toString();
						tmpnext[i].add(new_node);
					}
				}
			}
		}

	}

	public static void main(String[] args) {
		// System.out.println(Binary(1, 4));

		String input = "1,2,3,4";
		String[] spliter = input.split(",");
		nOfBits = 3;
		for (int i = 0; i < spliter.length; i++) {
			int in = Integer.parseInt(spliter[i]);
			String biny = Binary(in);
			spliter[i]=biny;

		}
		LinkedList<node>[] myList = new LinkedList<node>[spliter.length];
		//String str =

	}
}