Given an array arr[] of size N. Find the maximum value of arr[j] – arr[i] + arr[l] – arr[k], such that i < j < k < l.

Example 1:

Input
N = 3
Arr[]  = {1, 2, 3}
Output:-1
Explanation: 
N<4 so no such i,j,k,l is possible.

Example 2:

Input:
N = 5
Arr[] = {4, 8, 9, 2, 20}
Output: 23
Explanation:
Here i = 0, j = 2, k = 3, l = 4 so
arr[j] – arr[i] + arr[l] – arr[k] 
= 9 – 4 + 20 – 2 = 23

Your Task:  
You don't need to read input or print anything. Your task is to complete the function findMaxValue() which takes the array arr[] and its size N as input parameters and returns the maximum value of arr[j] – arr[i] + arr[l] – arr[k].

Expected Time Complexity : O(N)
Expected Auxiliary Space : O(N)

Constraints:
1 ≤ N ≤ 10⁵
1 ≤ A[i] ≤ 10⁵