You are given an integer array A.  From some starting index, you can make a series of jumps.  The (1st, 3rd, 5th, ...) jumps in the series are called odd numbered jumps, and the (2nd, 4th, 6th, ...) jumps in the series are called even numbered jumps.
You may from index i jump forward to index j (with i < j) in the following way:

During odd numbered jumps (ie. jumps 1, 3, 5, ...), you jump to the index j such that A[i] <= A[j] and A[j] is the smallest possible value.  If there are multiple such indexes j, you can only jump to the smallest such index j.
During even numbered jumps (ie. jumps 2, 4, 6, ...), you jump to the index j such that A[i] >= A[j] and A[j] is the largest possible value.  If there are multiple such indexes j, you can only jump to the smallest such index j.
(It may be the case that for some index i, there are no legal jumps.)

A starting index is good if, starting from that index, you can reach the end of the array (index A.length - 1) by jumping some number of times (possibly 0 or more than once.)
Return the number of good starting indexes.
 
Example 1:
Input: [10,13,12,14,15]
Output: 2
Explanation: 
From starting index i = 0, we can jump to i = 2 (since A[2] is the smallest among A[1], A[2], A[3], A[4] that is greater or equal to A[0]), then we can't jump any more.
From starting index i = 1 and i = 2, we can jump to i = 3, then we can't jump any more.
From starting index i = 3, we can jump to i = 4, so we've reached the end.
From starting index i = 4, we've reached the end already.
In total, there are 2 different starting indexes (i = 3, i = 4) where we can reach the end with some number of jumps.


Example 2:
Input: [2,3,1,1,4]
Output: 3
Explanation: 
From starting index i = 0, we make jumps to i = 1, i = 2, i = 3:

During our 1st jump (odd numbered), we first jump to i = 1 because A[1] is the smallest value in (A[1], A[2], A[3], A[4]) that is greater than or equal to A[0].

During our 2nd jump (even numbered), we jump from i = 1 to i = 2 because A[2] is the largest value in (A[2], A[3], A[4]) that is less than or equal to A[1].  A[3] is also the largest value, but 2 is a smaller index, so we can only jump to i = 2 and not i = 3.

During our 3rd jump (odd numbered), we jump from i = 2 to i = 3 because A[3] is the smallest value in (A[3], A[4]) that is greater than or equal to A[2].

We can't jump from i = 3 to i = 4, so the starting index i = 0 is not good.

In a similar manner, we can deduce that:
From starting index i = 1, we jump to i = 4, so we reach the end.
From starting index i = 2, we jump to i = 3, and then we can't jump anymore.
From starting index i = 3, we jump to i = 4, so we reach the end.
From starting index i = 4, we are already at the end.
In total, there are 3 different starting indexes (i = 1, i = 3, i = 4) where we can reach the end with some number of jumps.


Example 3:
Input: [5,1,3,4,2]
Output: 3
Explanation: 
We can reach the end from starting indexes 1, 2, and 4.



 
Note:

1 <= A.length <= 20000
0 <= A[i] < 100000

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n\n    memo = {}\n    next_memo = {}\n    \n    def get_next_move(self, array, index, odd):\n        if index == len(array) - 1:\n            return index\n        \n        if (index, odd) not in list(Solution.next_memo.keys()):\n            if odd:\n                min_geq = 1e99\n                next_index = -1\n\n                for i in range(index + 1, len(array)):\n\n                    if array[i] == array[index]:\n                        next_index = i\n                        break\n                    if array[i] > array[index]:\n                        if array[i] < min_geq:\n                            min_geq = array[i]\n                            next_index = i        \n            else:\n                max_leq = -1e99\n                next_index = -1\n\n                for i in range(index + 1, len(array)):\n                    if array[i] == array[index]:\n                        next_index = i\n                        break\n                    if array[i] < array[index]:\n                        if array[i] > max_leq:\n                            max_leq = array[i]\n                            next_index = i\n            Solution.next_memo[(index, odd)] = next_index\n\n        return Solution.next_memo[(index, odd)]            \n        \n    \n    def can_get_to_end(self, array, index, odd):\n        \n        if (index, odd) not in list(Solution.memo.keys()):            \n            next_index = self.get_next_move(array, index, odd)\n            \n            if next_index == len(array) - 1:\n                Solution.memo[(index, odd)] = 1\n            elif next_index == -1:\n                Solution.memo[(index, odd)] = 0\n            else:\n                Solution.memo[(index, odd)] = self.can_get_to_end(array, next_index, not odd)\n        \n        return Solution.memo[(index, odd)]\n        \n    \n    def other(self, a):\n        \n        b = list(sorted(list(range(len(a))), key=lambda i: a[i]))\n        c = list(sorted(list(range(len(a))), key=lambda i: -a[i]))\n        \n        \n        odd_next = {}\n        even_next = {}\n        i = 1\n        while i < len(b):\n            j = i\n            while j < len(b) - 1 and b[j] <= b[i - 1]:\n                j += 1\n            if b[j] > b[i - 1]:\n                odd_next[b[i - 1]] = b[j]\n            i += 1\n        \n        i = 1\n        while i < len(c):\n            j = i\n            while j < len(c) - 1 and c[j] <= c[i - 1]:\n                j += 1\n            if c[j] > c[i - 1]:\n                even_next[c[i - 1]] = c[j]\n            i += 1\n        \n        \n#         print(b)\n#         print(c)\n        \n#         print(odd_next)\n#         print(even_next)\n        \n        paths = 0\n        \n        for start in list(odd_next.keys()):\n            \n            index = start\n            can_go = True\n            odd = True\n            while can_go and index != len(a) - 1:\n                if odd:\n                    if index in list(odd_next.keys()):\n                        index = odd_next[index]\n                    else:\n                        can_go = False\n                else:\n                    if index in list(even_next.keys()):\n                        index = even_next[index]\n                    else:\n                        can_go = False\n                odd = not odd\n            if index == len(a) - 1:\n                # print(start)\n                paths += 1\n\n        if len(a) - 1 not in list(odd_next.keys()):\n            paths += 1\n        \n        \n        return paths\n    \n    \n    def oddEvenJumps(self, a: List[int]) -> int:\n        return self.other(a)\n    \n    \n#         paths = 0\n        \n#         for i in range(len(a)):\n#             _ = self.can_get_to_end(a, len(a) - i, True)\n#             _ = self.can_get_to_end(a, len(a) - i, False)\n        \n#         for i in range(len(a)):\n#             paths += self.can_get_to_end(a, i, True)\n        \n#         Solution.memo = {}\n#         Solution.next_memo = {}\n#         return paths\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'oddEvenJumps'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 8120