A9288 | Word Folding

The input will consist of one line containing a single string of $n$ characters with $1<=n<=1000$ and no spaces. All characters of the string will be uppercase letters.

This problem doesn't have subproblems. You will get 5 points for the correct submission.

Print a single integer — the size of the largest pile composed of identical characters that can be seen in a valid result of folding operations on the given string.

Consider the first example. Manao can create a pile of three 'A's using the folding "AB|RACAD|ABRA", which results in the following structure:

<br></br>ABRA<br></br>DACAR<br></br> AB<br></br>In the second example, Manao can create a pile of three 'B's using the following folding: "AB|BB|CBDB".

<br></br>CBDB<br></br>BB<br></br>AB<br></br>Another way for Manao to create a pile of three 'B's with "ABBBCBDB" is the following folding: "AB|B|BCBDB".

<br></br> BCBDB<br></br> B<br></br>AB<br></br>In the third example, there are no folds performed and the string is just written in one line.