You are given a string s consisting only of first 20 lowercase Latin letters ('a', 'b', ..., 't').

Recall that the substring s[l; r] of the string s is the string s_l s_{l + 1} ... s_r. For example, the substrings of "codeforces" are "code", "force", "f", "for", but not "coder" and "top".

You can perform the following operation no more than once: choose some substring s[l; r] and reverse it (i.e. the string s_l s_{l + 1} ... s_r becomes s_r s_{r - 1} ... s_l).

Your goal is to maximize the length of the maximum substring of s consisting of distinct (i.e. unique) characters.

The string consists of distinct characters if no character in this string appears more than once. For example, strings "abcde", "arctg" and "minecraft" consist of distinct characters but strings "codeforces", "abacaba" do not consist of distinct characters.

Input

The only line of the input contains one string s consisting of no more than 10^6 characters 'a', 'b', ..., 't' (first 20 lowercase Latin letters).

Output

Print one integer — the maximum possible length of the maximum substring of s consisting of distinct characters after reversing no more than one its substring.

Examples

Input


abacaba


Output


3


Input


abcdecdf


Output


6


Input


aabbcc


Output


3


Input


abcdeefc


Output


6
#include <bits/stdc++.h>
using namespace std;
const int K = (20);
int F[1 << K];
int A[1 << K];
void sosdp() {
  for (long long mask = 0, to = 1 << K; mask < to; mask++) {
    F[mask] = A[mask];
  }
  for (long long i = 0, to = K; i < to; i++)
    for (long long mask = 0, to = 1 << K; mask < to; mask++) {
      if (mask & (1 << i)) F[mask] = max(F[mask], F[mask ^ (1 << i)]);
    }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  string s;
  cin >> s;
  for (long long i = 0, to = (int)s.size(); i < to; i++) {
    int mask = 0;
    for (long long j = 0, to = K; j < to; j++) {
      if (i + j >= (int)s.size()) break;
      int value = s[i + j] - 'a';
      if (mask & (1 << value)) break;
      mask |= (1 << value);
      A[mask] = __builtin_popcount(mask);
    }
  }
  sosdp();
  int ans = 0;
  for (long long i = 0, to = 1 << K; i < to; i++) {
    ans = max(ans, A[i] + F[(1 << K) - i - 1]);
  }
  cout << ans << endl;
  return 0;
}
