#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;


int main() {

    string S1;
    cin >> S1;
    string S2;
    cin >> S2;
    string S = S1 + S2;

    int N = 15;

    vector<int> vs(N, 0);

    for (int i = 1; i < N; ++i) {
        if (S[i - 1] == 'o') {
            vs[i] = vs[i - 1] + 1;
        }
    }

    int m = 0;
    for (int i = 0; i < N; ++i) {
        m = max(m, vs[i]);
    }

    cout << m << endl;
    return 0;
}