#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; typedef long double ld; const ll INF = 1e+14; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LDP; typedef pair LP; void solve() { int n; string s; cin >> n >> s; int ans = 0; rep1(l, n) { rep(i, n) { int j = i + l; int k = j + l; if (k >= n)continue; if (s[i] == 'U'&&s[j] == 'M'&&s[k] == 'G')ans++; } } cout << ans << endl; } int main() { solve(); //stop return 0; }