#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int N;
    cin>>N;
    string s;
    cin>>s;
    using B = bitset<5050>;
    B a,b,c;
    rep(i,N){
        if(s[i]=='U')a[i]=1;
        if(s[i]=='M')b[i]=1;
        if(s[i]=='G')c[i]=1;
    }
    ll ans=0;
    rep(i,N){
        B ret = (a<<i)&b&(c>>i);
        ans+=ret.count();
    }
    cout<<ans<<endl;
    return 0;
}