#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
using namespace std;

typedef long long ll;
int main(void){
	string a,b;
	int k=0,l=0;
	cin>>a>>b;

	re(i,a.size()){
		k=((a[i]=='o')?k+1:0);
		l=max(k,l);
	}
	re(i,b.size()){
		k=((b[i]=='o')?k+1:0);
		l=max(k,l);
	}

	cout<<l<<endl;
	return 0;
}