Given an array of n distinct elements. Find the length of shortest unordered (neither increasing nor decreasing) sub array in given array.

Example 1:

Input:
N = 5
A[] = {7, 9, 10, 8, 11}
Output:
3
Explanation:
Shortest unsorted subarray is 9, 10, 8
which is of 3 elements.

Example 2:

Input:
N = 4
A[] = {1, 2, 3, 5}
Output:
0

Your Task:  
You don't need to read input or print anything. Your task is to complete the function shortestUnorderedSubarray() which takes the array A[] and its size N as inputs and returns the length of shortest unordered subarray.

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

Constraints:
1 <= N <= 10⁵
1 <= A[i] <= 10⁵