#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    string s[2];
    cin >> s[0] >> s[1];
    s[0] += s[1];
    s[0] += 'x';
    int ans = 0;
    rep(i,s[0].size()){
        if(s[0][i] == 'o'){
            int tmp = 0;
            while(s[0][i] == 'o'){
                tmp++;
                i++;
            }
            ans = max(ans, tmp);
        }
    }

    

    cout << ans << endl;
    return 0;
}