#include using namespace std; using ll = long long; using VI = vector; using VL = vector; using PII = std::pair; using PLL = std::pair; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define allpt(v) (v).begin(), (v).end() #define allpt_r(v) (v).rbegin(), (v).rend() const int mod = 1e9 + 7; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template void show1dvec(vector v) { int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } template void show2dvec(vector> v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } vector run_length(string &v) { int prev, next, counter; int n = v.size(); vector ret = {0}; next = v[0]; prev = next; counter = 1; rep(i, n - 1) { next = v[i + 1]; if (next == prev) counter++; else { if (v[i] == 'o') ret.push_back(counter); counter = 1; } if (i == n - 1 && v[i] == 'o') ret.push_back(counter); prev = next; } return ret; } int main() { #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif string s, a, b; s = "x"; cin >> a >> b; s += (a + b + "x"); VI holiday = run_length(s); cout << *max_element(allpt(holiday)) << rt; return 0; }