Given n balloons, each balloon is painted with a number on it represented by an array nums. You are to burst all the balloons. If you burst balloon i, you get nums[left] * nums[i] * nums[right] coins. Here, left and right are adjacent indices of i. After the burst, the left and right balloons become adjacent. Find the maximum coins you can collect by bursting the balloons wisely.