#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 100005, M = 55;
ll dp[N], p_pow[N], nxt[M][N];
vi a[M][M];
int m;

void slv() {
    int n;
    string s;
    cin >> n >> s;
    map<char, int> mp;
    vector<char> v;
    for (int i = 0; i < n; ++i) {
        if (mp[s[i]]) continue;
        mp[s[i]] = ++m;
        v.pub(s[i]);
    }
    for (int i = 0; i < m; ++i) {
        int ind1 = mp[v[i]];
        for (int j = 0; j < m; ++j) {
            if (i == j) continue;
            int ind2 = mp[v[j]];
            a[ind1][ind2].assign(n + 1, 0);
            for (int ind = 1; ind <= n; ++ind) {
                a[ind1][ind2][ind] = a[ind1][ind2][ind - 1];
                if (s[ind - 1] == v[i]) {
                    ++a[ind1][ind2][ind];
                }
                else if (s[ind - 1] == v[j]) {
                    --a[ind1][ind2][ind];
                }
            }
        }
    }
    ll p = 31;
    p_pow[0] = 1ll;
    for (int i = 1; i <= m; ++i) {
        p_pow[i] = (p_pow[i - 1] * p) % MOD;
    }
    for (int i = 1; i <= m; ++i) {
        vll v(n + 1, 0);
        int cur = 0;
        for (int ind = 0; ind <= n; ++ind) {
            cur = 0;
            for (int j = 1; j <= m; ++j) {
                if (i == j) continue;
                v[ind] += a[i][j][ind] * p_pow[cur];
                if (v[ind] > MOD) v[ind] -= MOD;
                ++cur;
            }
        }
        unordered_map<ll, int> last;
        for (int ind = n; ind >= 0; --ind) {
            nxt[i][ind] = last[v[ind]];
            last[v[ind]] = ind;
        }
    }
    ll ans = 0;
    for (int i = n; i >= 1; --i) {
        int ind = mp[s[i - 1]];
        int r = nxt[ind][i - 1];
        if (!r) continue;
        dp[i] = dp[r + 1] + 1ll;
        if (dp[i] > MOD) dp[i] -= MOD;
        ans += dp[i];
        if (ans > MOD) ans -= MOD;
    }
    cout << ans;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}