#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }
template<class T> void operator>> (istream& ist, vector<T>& vs) { for(auto& e: vs) cin >> e; }

typedef long long ll;
int const inf = 1<<29;

int main() {
/*
  std::string hoge = "…";
  for (size_t i = 0; i < hoge.size(); ++i) {
    std::cout << "idx: " << i << ", " << std::to_string(hoge[i]) << "\n";
  }
  idx: 0, -30
  idx: 1, -128
  idx: 2, -90
*/
  std::string s; std::cin >> s;
//  std::cout << s << "\n";
  int ans = 0, cand = 0;
  int hoge = 3;
  for (size_t i = 0; i < s.size(); ++i) {
    if (i + 2 < s.size() && s[i] == -30 && s[i+1] == -128 && s[i+2] == -90) {
      cand++;
      hoge = 1;
    } else if (hoge < 3) {
      hoge++;
    } else {
      ans = max(ans, cand);
      cand = 0;
    }
  }

  ans = max(ans, cand);
  std::cout << ans << "\n";
  
  return 0;
}