Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must appear an even number of times.
 
Example 1:
Input: s = "eleetminicoworoep"
Output: 13
Explanation: The longest substring is "leetminicowor" which contains two each of the vowels: e, i and o and zero of the vowels: a and u.

Example 2:
Input: s = "leetcodeisgreat"
Output: 5
Explanation: The longest substring is "leetc" which contains two e's.

Example 3:
Input: s = "bcbcbc"
Output: 6
Explanation: In this case, the given string "bcbcbc" is the longest because all vowels: a, e, i, o and u appear zero times.

 
Constraints:

1 <= s.length <= 5 x 10^5
s contains only lowercase English letters.

```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 = "#https://leetcode-cn.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/solution/jian-dan-de-si-lu-by-mnizy/\n\nclass Solution:\n    def findTheLongestSubstring1(self, s: str) -> int:\n        \n        def check(L, R, cnt_memo):\n            if L>R:\n                return 0 \n            elif (L, R) in memo:\n                return memo[(L, R)]\n            else:\n                if all(v%2==0 for v in list(cnt_memo.values())):\n                    return R-L+1\n                else:\n                    old_L = L\n                    new_memo = {k:v for k, v in list(cnt_memo.items())}\n                    \n                    while s[L] not in 'aeiou':\n                        L += 1\n                    new_memo[s[L]] -= 1\n                    if new_memo[s[L]] == 0:\n                        del new_memo[s[L]]\n                    res1 = check(L+1, R, new_memo)\n                    L = old_L\n                    \n                    old_R = R\n                    new_memo = {k:v for k, v in list(cnt_memo.items())}\n                    while s[R] not in 'aeiou':\n                        R -= 1\n                    new_memo[s[R]] -= 1\n                    if new_memo[s[R]] == 0:\n                        del new_memo[s[R]]\n                    res2= check(L, R-1, new_memo)\n                    R = old_R\n                    res = max(res1, res2)\n                    memo[(L, R)] = res\n                    return res\n        \n        cnt_memo = collections.Counter(s)\n        cnt_memo = {k:v for k, v in list(cnt_memo.items()) if k in 'aeiou'}\n        memo = dict()\n        res = check(0, len(s)-1, cnt_memo)\n        # print (memo)\n        return res\n        \n    def findTheLongestSubstring(self, s: str) -> int:\n        res = 0\n        curr = 0\n        memo = dict()\n        memo[0] = -1\n        for i, c in enumerate(s):\n            if c=='a':\n                curr ^= 1\n            elif c=='e':\n                curr ^= 2\n            elif c=='i':\n                curr ^= 4\n            elif c=='o':\n                curr ^= 8\n            elif c=='u':\n                curr ^= 16\n            if curr in memo:\n                res = max(res, i-memo[curr])\n            else:\n                memo[curr] = i\n        return res\n        \n        \n        return\n        \n        \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'findTheLongestSubstring'
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: 5662