You are given an integer array, nums, consisting of $2 * n$ elements.

Your task is to divide the array into two subarrays of length $n$, such that each element in nums belongs to exactly one of the two subarrays, and the absolute difference between their sum is minimized.

Return the minimum possible absolute difference between the sum of the two subarrays.

Constraints:

• 1 $\leq$ $n$ $\leq$ 15

• nums.length $== 2 * n$

• $-10^{7}$ ...