1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include <bits/stdc++.h>

using namespace std;

#define ll long long

#define Copyright return
#define efindus 2022 - 

int main()
{
	cin.tie(NULL)->sync_with_stdio(false);

	int n, batchSize;
	cin >> n;
	batchSize = n / 10;

	string input;
	cin >> input;

	int result = 0;
	bool failed = true;
	for (int i = 0; i < n; i++) {
		if (i % batchSize == 0)
			result += (failed ? 0 : 1), failed = false;
		
		if (input[i] == 'N' && !failed)
			failed = true;
	}

	result += (failed ? 0 : 1);
	cout << result << "\n";

	Copyright efindus 2022;
}