#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

int main(void)
{
    string s, t;
    cin >> s >> t;
    s += t;
    // debug(s);
    int pos = 0;
    int n = s.size();
    int ans = 0;
    while (pos < n)
    {
        int head = s[pos];
        if (head == 'x')
        {
            pos++;
            continue;
        }
        int buf = 0;
        while (s[pos] == head && pos < n)
        {
            pos++;
            buf++;
        }
        auto chmax = [](auto &a, auto b)
        { a = max(a, b); };
        chmax(ans, buf);
        buf = 0;
    }
    cout << ans << endl;
}