#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
typedef long long ll;
using namespace std;
const ll inf=1e18;

int main(){
    string s,t;
    int n;
    cin >> n >> s >> t;
    s += t;

    string x(n, 'x');
    s = x+s+x;

    int ans = 0;
    for(int i = 0; i < s.size()-n+1; i++){
        t = s;
        if(n != 0){
            for(int j = i; j < i+n; j++){
                if(t[j] == 'o') break;
                t[j] = 'o';
            }
        }


        int pos = 0;
        while(pos != s.size()){
            while(pos != s.size() && t[pos] == 'x')    pos++;
            int now = 0;
            while(pos != s.size() && t[pos] == 'o'){
                pos++;
                now++;
            }
            ans = max(ans, now);
        }
    }

    cout << ans << endl;
    return 0;
}