Maximize Product of Palindromic Substrings

Given a string s, the task is to find and print two non-intersecting palindromic substrings of odd length such that the product of their lengths is maximized. Formally, you need to choose four integers i, j, k, l such that 0 ≤ i ≤ j < k ≤ l < length(s), and both substrings s[i...j] and s[k...l] are palindromes and have odd lengths. Print the maximum possible product of the lengths of the two non-intersecting palindromic substrings.