#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;

int main() {
	int d;
	cin >> d;
	char c[20];
	REP(i, 14) {
		cin >> c[i];
	}
	int ans = 0;
	REP(i, 14) {
		int sum = 0;
		int t = d;
		bool f = false;
		FOR(j, i, 14) {
			if (c[j] == 'x') {
				if (f)
					break;
				else {
					f = true;
					for (; j < 14; j++) {
						if (c[j] == 'o') {
							sum++;
							break;
						}
						if (t <= 0) {
							j--;
							break;
						}
						t--;
						sum++;
						if (j == 13)
							sum += t;

					}
				}
			}
			else {
				sum++;
				if (!f && j == 13)
					sum += t;
			}
		}
		ans = max(ans, sum);
	}
	int cnt = 0;
	if (c[0] == 'o') {
		REP(i, 14) {
			if (c[i] == 'x')
				break;
			cnt++;
		}
		cnt += d;
	}
	else {
		REP(i, 14) {
			if (c[i] == 'o') {
				FOR(j, i, 14) {
					cnt++;
					if (c[j + 1] == 'x')
						break;
				}
				break;
			}
		}
		cnt += d;
	}
	ans = max(ans, cnt);
	cout << ans << endl;
	return 0;
}