#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;
    string s,t;
    cin>>s>>t;
    if(s[6]=='o' and t[0]=='o') cnt++;
    for(int i=0;i<7;i++){
        if(s[i]=='o' and s[i+1]=='o') cnt++;
        else if(t[i]=='o' and t[i+1]=='o') cnt++;
    }
  
    
    cout<<cnt+1<<endl;
    return 0;
}