You are given a string $S$ consisting of lowercase English letters. Your task is to find the maximum number of palindromic subsequences that can be created from the given string. Each palindromic subsequence must have a length greater than $1,$ and each element of the string can be part of atmost one palindromic subsequence.

We'll call non$-$empty string $S=S_1{S}_{2}cdots{S}_{|s|}|S|STS1T100$

$2|S|{10}^4$write code in$.$ ahacjava