A subarray A[i], A[i+1], ..., A[j] of A is said to be turbulent if and only if:

For i <= k < j, A[k] > A[k+1] when k is odd, and A[k] < A[k+1] when k is even;
OR, for i <= k < j, A[k] > A[k+1] when k is even, and A[k] < A[k+1] when k is odd.

That is, the subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray.
Return the length of a maximum size turbulent subarray of A.
 

Example 1:
Input: [9,4,2,10,7,8,8,1,9]
Output: 5
Explanation: (A[1] > A[2] < A[3] > A[4] < A[5])


Example 2:
Input: [4,8,12,16]
Output: 2


Example 3:
Input: [100]
Output: 1




 
Note:

1 <= A.length <= 40000
0 <= A[i] <= 10^9

```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    def maxTurbulenceSize(self, A: List[int]) -> int:\n        '''\n        A subarray of A is said to be turbulent if and only if:\n\n        For i <= k < j, \n            - A[k] > A[k+1] when k is ODD, and A[k] < A[k+1] when k is even;\n            \n        OR, for i <= k < j,\n            - A[k] > A[k+1] when k is EVEN, and A[k] < A[k+1] when k is odd.\n        \n        [ 0 < 1 >= 1 !< 0 !> 1 !< 0 !> 1 =< 1 > 0 =< 0 ]\n        \n        '''\n        \n        length  = 1\n        longest = length\n        \n        for i in range(1, len(A)):\n            \n            # odd\n            if ((i % 2) == 1):\n                # fits pattern\n                if (A[i] > A[i-1]):\n                    length += 1\n                    \n                else:\n                    longest = max(length, longest)\n                    length  = 1\n                    \n            # even\n            elif ((i % 2) == 0):\n                # fits pattern\n                if (A[i] < A[i-1]):\n                    length += 1\n                    \n                else:\n                    longest = max(length, longest)\n                    length  = 1\n        longest = max(length, longest)          \n           \n        length  = 1 \n        longest2 = length\n        for i in range(1, len(A)):\n            \n            # odd\n            if ((i % 2) == 1):\n                # fits pattern\n                if (A[i] < A[i-1]):\n                    length += 1\n                    \n                else:\n                    longest2 = max(length, longest2)\n                    length  = 1\n                    \n            # even\n            elif ((i % 2) == 0):\n                # fits pattern\n                if (A[i] > A[i-1]):\n                    length += 1\n                    \n                else:\n                    longest2 = max(length, longest2)\n                    length  = 1\n            longest2 = max(length, longest2)           \n                    \n        return max(longest, longest2)\n    \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxTurbulenceSize'
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: 5938