An almost-sorted sequence is a sequence that is strictly increasing or strictly decreasing if you remove a single element from the array (no more, no less). Write a function that returns true if an array is almost-sorted, and false otherwise.

For example, if you remove 80 from the first example, it is perfectly sorted in ascending order. Similarly, if you remove 7 from the second example, it is perfectly sorted in descending order.

Examples

almost_sorted([1, 3, 5, 9, 11, 80, 15, 33, 37, 41] ) ➞ true

almost_sorted([6, 5, 4, 7, 3]) ➞ true

almost_sorted([6, 4, 2, 0]) ➞ false
// Sequence is already sorted.

almost_sorted([7, 8, 9, 3, 10, 11, 12, 2]) ➞ false
// Requires removal of more than 1 item.

Notes

• Completely sorted arrays should return false.
• Arrays will always be > 3 in length (to remove ambiguity).
• Numbers in each input array will be unique - don't worry about "ties".