static int runTestCase(int casenum__) {
		switch (casenum__) {
		case 0: {
			int treeHeight = 1;
			long expected__ = 1;

			return verifyCase(casenum__, expected__,
					new TrafficCongestionDivTwo().theMinCars(treeHeight));
		}
		case 1: {
			int treeHeight = 2;
			long expected__ = 3;

			return verifyCase(casenum__, expected__,
					new TrafficCongestionDivTwo().theMinCars(treeHeight));
		}
		case 2: {
			int treeHeight = 3;
			long expected__ = 5;

			return verifyCase(casenum__, expected__,
					new TrafficCongestionDivTwo().theMinCars(treeHeight));
		}
		case 3: {
			int treeHeight = 10;
			long expected__ = 683;

			return verifyCase(casenum__, expected__,
					new TrafficCongestionDivTwo().theMinCars(treeHeight));
		}
		case 4: {
			int treeHeight = 60;
			long expected__ = 768614336404564651L;

			return verifyCase(casenum__, expected__,
					new TrafficCongestionDivTwo().theMinCars(treeHeight));
		}

		// custom cases

		/*
		 * case 5: { int treeHeight = ; long expected__ = ;
		 * 
		 * return verifyCase(casenum__, expected__, new
		 * TrafficCongestionDivTwo().theMinCars(treeHeight)); }
		 */
		/*
		 * case 6: { int treeHeight = ; long expected__ = ;
		 * 
		 * return verifyCase(casenum__, expected__, new
		 * TrafficCongestionDivTwo().theMinCars(treeHeight)); }
		 */
		/*
		 * case 7: { int treeHeight = ; long expected__ = ;
		 * 
		 * return verifyCase(casenum__, expected__, new
		 * TrafficCongestionDivTwo().theMinCars(treeHeight)); }
		 */
		default:
			return -1;
		}
	}