You are given an array A of N integers. A subarray from l to r (l<r) is good if A[l]!=A[r].
You have to find the maximum possible sum of elements of a good subarray. If there is no such good subarray then print "Not Possible".
Input Format:
Output Format:
For each test case, print the maximum possible sum of elements of good subarray or print "Not Possible" (without double quotes) if there is no such good subarray.
Constraints:
1≤T≤102≤N≤2∗105−109≤A[i]≤109
For test case 1: The given array is [2,3,2,4,2], here maximum possible sum of elements of a good subarray is 11, which is from index (1,4).