#include <bits/stdc++.h>
using namespace std;
const double eps = 1.0e-11;
const double pi = acos(-1.0);
int main() {
  string s;
  cin >> s;
  vector<int> dp((int)(s).size(), 1);
  int res = 1;
  for (long long i = 0; i < (int)(s).size(); i++) {
    for (long long j = 0; j < i; j++)
      if (s[i] == s[j] && (i - j) % 2)
        dp[i] = max(dp[i], dp[j] + 1), res = max(res, dp[i]);
  }
  cout << res << endl;
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

You will receive 5 points for solving this problem.

Manao has invented a new operation on strings that is called folding. Each fold happens between a pair of consecutive letters and places the second part of the string above first part, running in the opposite direction and aligned to the position of the fold. Using this operation, Manao converts the string into a structure that has one more level than there were fold operations performed. See the following examples for clarity.

We will denote the positions of folds with '|' characters. For example, the word "ABRACADABRA" written as "AB|RACA|DAB|RA" indicates that it has been folded three times: first, between the leftmost pair of 'B' and 'R' letters; second, between 'A' and 'D'; and third, between the rightmost pair of 'B' and 'R' letters. Here are several examples of folded strings:
    
    
      
    "ABCDEF|GHIJK" |  "A|BCDEFGHIJK" |  "AB|RACA|DAB|RA" |  "X|XXXXX|X|X|XXXXXX"  
                   |                 |                   |       XXXXXX  
        KJIHG      |   KJIHGFEDCB    |      AR           |       X  
       ABCDEF      |            A    |     DAB           |       X  
                   |                 |     ACAR          |       XXXXX  
                   |                 |       AB          |           X  
    

One last example for "ABCD|EFGH|IJ|K": 
    
    
      
     K  
    IJ  
    HGFE  
    ABCD  
    

Manao noticed that each folded string can be viewed as several piles of letters. For instance, in the previous example, there are four piles, which can be read as "AHI", "BGJK", "CF", and "DE" from bottom to top. Manao wonders what is the highest pile of identical letters he can build using fold operations on a given word. Note that the pile should not contain gaps and should start at the bottom level. For example, in the rightmost of the four examples above, none of the piles would be considered valid since each of them has gaps, starts above the bottom level, or both.

Input

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.

Output

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.

Examples

Input

ABRACADABRA


Output

3


Input

ABBBCBDB


Output

3


Input

AB


Output

1

Note

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: 
    
    
      
    ABRA  
    DACAR  
       AB  
    

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

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

In the third example, there are no folds performed and the string is just written in one line.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const double eps = 1.0e-11;
const double pi = acos(-1.0);
int main() {
  string s;
  cin >> s;
  vector<int> dp((int)(s).size(), 1);
  int res = 1;
  for (long long i = 0; i < (int)(s).size(); i++) {
    for (long long j = 0; j < i; j++)
      if (s[i] == s[j] && (i - j) % 2)
        dp[i] = max(dp[i], dp[j] + 1), res = max(res, dp[i]);
  }
  cout << res << endl;
  return 0;
}

```