public static void main(String[] args) {
		Random gen = new Random();
		for (int times = 0; times < 100000; ++times) {
			int n;
			int[] A;
			if (args.length == 1) {
				n = Integer.valueOf(args[0]);
			} else {
				// Get a random number from [2, 11]
				n = gen.nextInt(10) + 2;
			}
			A = new int[n];
			for (int i = 0; i < n; ++i) {
				// Get a random number from [-9, 9]
				A[i] = gen.nextInt(19) - 9;
				System.out.print(A[i] + " ");

			}
			System.out.println();
			int res = find_biggest_n_1_product(A);
			System.out.println(res);
			assert res == check_ans(A);
		}
	}