#include #define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++) const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; using namespace std; typedef long long ll; typedef vector vi; typedef vector vll; typedef pair pii; int main() { cin.tie(0); ios::sync_with_stdio(false); int T; cin >> T; string s, t; cin >> s >> t; s += t; int ans = 0; for (int j = 0; j + T <= 14; j++) { string ss = s; for (int i = j; i < j+T; i++) { if (s[i] == 'o') break; ss[i] = 'o'; } int cur = 0; while (cur < 14) { int i; for (i = cur; i < 14; i++) { if (ss[i] != 'o') break; } ans = max(ans, i-cur); cur = i+1; } } cout << ans << endl; return 0; }