#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    string S1,S2,S;
    cin >> S1 >> S2;
    S = S1 + S2;
    
    int ans = 0;
    int count = 0;
    for ( int i = 1; i < S.length(); i++ ) {
        if ( S[i] == 'o' ) { count++; }
        else {
            ans = max( ans, count );
            count = 0;
        }
    }
    ans = max( ans, count );
    
    cout << ans << endl;
    
    return 0;
}