#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
const int inf = 1e9 + 7;
const long double eps = 1e-6;
int main() {
  string s;
  cin >> s;
  int res1 = 0, res2 = 0, pos;
  int n = s.size();
  vector<int> dp1(n, 1), dp2(n, 1);
  dp1[0] = 1;
  dp2[0] = 1;
  for (auto(i) = (0); (i) < (n); ++i) {
    for (auto(j) = (0); (j) < (i); ++j) {
      if (s[i] >= s[j]) {
        dp1[i] = max(dp1[i], dp1[j] + 1);
      }
    }
  }
  for (int i = n - 1; i >= 0; --i) {
    for (int j = n - 1; j > i; --j) {
      if (s[i] >= s[j]) {
        dp2[i] = max(dp2[i], dp2[j] + 1);
      }
    }
  }
  int res = -1;
  for (auto(i) = (0); (i) < (n); ++i) {
    if (i < n - 1)
      res = max(res, dp1[i] + dp2[i + 1]);
    else
      res = max(res, dp1[i]);
  }
  cout << res;
  return 0;
}
