#include <iostream>
#include <vector>
#include <map>
#include<string>
#include<queue>
#include<math.h>
#define all(x) begin(x),end(x)
#define ll long long
#define P pair<int,int>
#define lP pait<ll,ll>
using namespace std;
int main() {
    int cnt=0,ans=0;
    string s,t,u;
    cin>>s>>t;
    u=s+t;
    for(int i=0;i<13;i++){
        if(u[i]=='o' and u[i+1]=='o'){
            cnt++;
            ans=max(ans,cnt);
        }
        else if(u[i]=='x') cnt=0;
    }
    if(ans>0) cout<<ans+1<<endl;
    else cout<<ans<<endl;
    return 0;
}