------
## 最终结论
```python
def longestDecomposition(text: str) -> int:
    n = len(text)
    if n == 0:
        return 0

    for i in range(1, n // 2 + 1):
        if text[:i] == text[-i:]:
            return 2 + longestDecomposition(text[i:n-i])

    return 1
```