Find every way to split the array until n groups of 2. Brute force recursion is acceptable.

Calculate the gcd of every pair and greedily multiply the largest gcds.