You have an array of 10 integers: [19, 81, 2, 41, 61, 59, 28, 69, 76, 88]. Find a way to divide these integers into 5 pairs, such that, if you add up the numbers in each pair, then the maximum sum among the 5 pairs is minimized. What is the minimum possible maximum sum?