#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
#define rep(i,x) for(int i=0;i<(int)(x);++i)

int main(){
	int max = 0, tmp = 0;
	string s1, s2;
	cin >> s1 >> s2;
	s1 += s2;
	rep(i, s1.size()) {
		if (s1[i] == 'x') {
			if (max < tmp) max = tmp;
			tmp = 0;
		} else {
			++tmp;
		}
	}
	if (max < tmp) max = tmp;
	cout << max << endl;
	return 0;
}