static int runTestCase(int casenum) {
		switch (casenum) {
		case 0: {
			int[] a = { 1, 0, 1 };
			int expected__ = 1;

			return verifyCase(casenum, expected__,
					new BinaryPolynomialDivTwo().countRoots(a));
		}
		case 1: {
			int[] a = { 0, 1, 0, 1 };
			int expected__ = 2;

			return verifyCase(casenum, expected__,
					new BinaryPolynomialDivTwo().countRoots(a));
		}
		case 2: {
			int[] a = { 1 };
			int expected__ = 0;

			return verifyCase(casenum, expected__,
					new BinaryPolynomialDivTwo().countRoots(a));
		}
		case 3: {
			int[] a = { 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1 };
			int expected__ = 0;

			return verifyCase(casenum, expected__,
					new BinaryPolynomialDivTwo().countRoots(a));
		}
		case 4: {
			int[] a = { 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0,
					0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0,
					1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1 };
			int expected__ = 1;

			return verifyCase(casenum, expected__,
					new BinaryPolynomialDivTwo().countRoots(a));
		}

		// custom cases

		/*
		 * case 5: { int[] a = ; int expected__ = ;
		 *
		 * return verifyCase(casenum, expected__, new
		 * BinaryPolynomialDivTwo().countRoots(a)); }
		 */
		/*
		 * case 6: { int[] a = ; int expected__ = ;
		 *
		 * return verifyCase(casenum, expected__, new
		 * BinaryPolynomialDivTwo().countRoots(a)); }
		 */
		/*
		 * case 7: { int[] a = ; int expected__ = ;
		 *
		 * return verifyCase(casenum, expected__, new
		 * BinaryPolynomialDivTwo().countRoots(a)); }
		 */
		default:
			return -1;
		}
	}