static int check_ans(int[] A) {
		int max_product = Integer.MIN_VALUE;
		for (int i = 0; i < A.length; ++i) {
			int product = 1;
			for (int j = 0; j < i; ++j) {
				product *= A[j];
			}
			for (int j = i + 1; j < A.length; ++j) {
				product *= A[j];
			}
			if (product > max_product) {
				max_product = product;
			}
		}
		System.out.println(max_product);
		return max_product;
	}