#include <iostream>
#include <vector>
#include <set>
#include <map>
using namespace std;
string s;
int n;
int k;
vector<vector<int>> pref;

bool check(int l,int r)// if l to r is a good range
    {
    int st=0;
    for(int type=1;type<=k;type++)
        {
        if(l!=0)
            {
            if(type==1)st=pref[r][type]-pref[l-1][type];
            else if(st!=(pref[r][type]-pref[l-1][type]))return false;
            }
        else
            {
            if(type==1)st=pref[r][type];
            else if(st!=(pref[r][type]))return false;
            }
        }
    return true;
    }

int main()
{
    set<char> dif;
    cin>>n>>s;
    for(auto x:s)dif.insert(x);
    k=dif.size();
    map<char,int> conv;
    int id=1;
    vector<int> a;
    a.reserve(n);
    for(auto &x:s)
        {
        if(conv[x]==0)
            {
            conv[x]=id++;
            }
        a.push_back(conv[x]);
        }
    pref.resize(n,vector<int>(k+1,0));
    for(int i=0;i<n;i++)
        {
        for(int type=1;type<=k;type++)
            {
            if(i==0)break;
            pref[i][type]=pref[i-1][type];
            }
        pref[i][a[i]]++;
        }
    long long ans=0;
    map<vector<int>,int> seen;
    vector<int> base(k,0);
    seen[base]=1;
    for(int i=0;i<n;i++)
        {
        vector<int> dif(k);
        for(int type=1;type<=k;type++)
            {
            dif[type-1]=pref[i][type]-pref[i][1];
            }
        int cnt=seen[dif];
        ans+=cnt;
        seen[dif]++;
        }
    //cout<<check(0,1)<<"\n";
    cout<<ans;
    return 0;
}