Return the largest possible k such that there exists a_1, a_2, ..., a_k such that:

Each a_i is a non-empty string;
Their concatenation a_1 + a_2 + ... + a_k is equal to text;
For all 1 <= i <= k,  a_i = a_{k+1 - i}.

 
Example 1:
Input: text = "ghiabcdefhelloadamhelloabcdefghi"
Output: 7
Explanation: We can split the string on "(ghi)(abcdef)(hello)(adam)(hello)(abcdef)(ghi)".

Example 2:
Input: text = "merchant"
Output: 1
Explanation: We can split the string on "(merchant)".

Example 3:
Input: text = "antaprezatepzapreanta"
Output: 11
Explanation: We can split the string on "(a)(nt)(a)(pre)(za)(tpe)(za)(pre)(a)(nt)(a)".

Example 4:
Input: text = "aaa"
Output: 3
Explanation: We can split the string on "(a)(a)(a)".

 
Constraints:

text consists only of lowercase English characters.
1 <= text.length <= 1000

```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    import random\n    def longestDecomposition(self, text: str) -> int:\n        \n        def check_eq(s,st1,st2,mx):\n            while s[st1] == s[st2] :\n                st1+=1\n                st2+=1\n                if st1 == mx: return True\n            # if st1 == mx: return True\n            return False\n        \n        if len(text) == 1: return 1\n        ln = len(text)\n        # dp = [(1,-1)]*((ln>>1)+1)\n        a = (1,-1)\n        b = (1,-1)\n        hsh_st = 0\n        hsh_ed = 0\n        ln_ch = 0\n        for i in range(1,(ln>>1)+1):\n            ln_ch += 1\n            # st1 = dp[i-1][1] + 1\n            st1 = b[1] + 1\n            # rnd = random.randint(3,1000)\n            hsh_st += ord(text[i-1])\n            st2 = ln - i\n            hsh_ed += ord(text[st2])\n            total = st1 + ln_ch\n            # print(f'cmp - {text[st1:total]} {text[st2:st2+ln_ch]}')\n            # print(f'st - {st1}, {st2}, {total}')\n            res = False\n            if hsh_st == hsh_ed:\n                # res = True\n                res = check_eq(text,st1,st2,total)\n            if res:\n                # print(f'--True--')\n                # dp[i] = (dp[i-1][0]+2,i-1)\n                b,a = (b[0]+2,i-1) ,b\n                # a = b\n                ln_ch = 0\n                hsh_st = 0\n                hsh_ed = 0\n            else:\n                # dp[i] = dp[i-1]\n                b,a = b,b\n        # print(dp)\n        # print(b,a)\n        if b[0] > a[0] and b[0] > 1 and len(text)%2 == 0:\n            return b[0] -1\n        return b[0]\n        \n        # if dp[-1][0] > dp[-2][0] and dp[-1][0] > 1 and len(text)%2 == 0:\n            # return dp[-1][0] - 1\n        # return dp[-1][0]\n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'longestDecomposition'
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: 6014