#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <fstream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int v, w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int f(string& s) {
	int maxi = 0;
	for (int i = 0; i <= 42; i++)
		for (int j = i; j <= 42; j++) {
			bool ok = true;
			for (int k = i; k < j; k++)
				if (s[k] == 'x')
					ok = false;
			if (ok) maxi = max(maxi, j - i);
		}
	return maxi;
}

int main() {
	int D; cin >> D;
	string s, t; cin >> s >> t;
	s = "xxxxxxxxxxxxxx" + s + t + "xxxxxxxxxxxxxx";
	int maxi = 0;
	for (int d = 0; d <= D; d++) {
		for (int i = 0; i + d <= 42; i++) {
			bool ok = true;
			string _s = s;
			for (int j = i; j < i + d; j++) {
				if (_s[j] == 'o') ok = false;
				else _s[j] = 'o';
			}
			if (ok) maxi = max(maxi, f(_s));
		}
	}
	cout << maxi << endl;
}