#include <stdio.h>
#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

//203
int main() {
	char hol[15];
	int carry = 0, maxc = 0;

	scanf("%s %s", hol, hol + 7);
	for (int i = 0; i < 14; i++) {
		if (hol[i] == 'o') {
			carry++;
			maxc = max(maxc, carry);
		} else {
			carry = 0;
		}
	}
	printf("%d\n", maxc);
}