How to solve the following problem? \n\n**Maximum Difference**\n\nGiven an unsorted array of N unique integers, find the maximum difference (absolute) between any two numbers such that their difference divides all the other numbers of the array. Print that particular pair of numbers in ascending order. If there are more than one such pairs, print the pair which has the maximum sum. Print 0, if no such pair exist. \n\n**Input format**\nRead the input from standard input stream. First line gives the number of integers N. Second line gives array elements separated by comma \n\n**Output format**\nPrint the pair of numbers separated by comma, 0 otherwise. Write the output to standard output stream  \n\n\n**Sample Input**\n7    \n2,4,6,8,12,14,16  \n\n**Sample Output**\n14,16\n\n**Explanation**\n14,16 is the pair which gives the maximum difference which divides all other elements of the array and has maximum sum.

How to solve the following problem? \n\nMaximum Difference\n\nGiven an unsorted array of N unique integers, find the maximum difference (absolute) between any t