#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <limits>


static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    string s;
    cin >> n >> s;
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 1; j < n; ++j) {
            if(i+j*2 >= n) break;
            if(s[i] == 'U' && s[i+j] == 'M' && s[i+2*j] == 'G') ans++;
        }
    }
    cout << ans << "\n";
    return 0;
}