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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <set>
#include <unordered_map>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

#define pb push_back
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;

using namespace std;


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

	int size;
	string s;
	cin >> size;
	cin >> s;

	int result = 0;
	int chunk = size / 10;

	for (int i=0; i<size-chunk+1; i += chunk) {
		bool inc = true;
		for (int j=0; j<chunk; ++j)
			if (s[i+j] != 'T') inc=false;
		if (inc) result++;
	}

	cout << result << endl;

	return 0;
}