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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <chrono>
using namespace std;



int main()
{
  ios::sync_with_stdio(false);
  int n;
  std::cin >> n;
  string word;
  std::cin >> word;
  int testCount = 10;
  int subtTestCount = n/10;
  int result =0;
  for (int i = 0; i < testCount; ++i)
  {
    bool passed = true;
    for (int pos = i * subtTestCount; pos < (i + 1) * subtTestCount; ++pos)
    {
      if (word[pos] == 'N')
        passed = false;
    }
    if (passed)
      result++;
  }
  std::cout << result;
  return 0;
};