#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    string str;
    cin >> str;
    vector<char> v(n);
    set<char> s;
    for(int i = 0; i < n; i++) {
        v[i] = str[i];
        s.insert(v[i]);
    }
    for(auto i = s.begin(); i != s.end(); i++) {
        cout << *i << " ";
    }
    int flats = 0;
    cout << m;
    auto beg = v.begin();
    auto end = v.begin();
    map<int, int> mym;
    while(beg != v.end()) {
        while(mym.size() != m && end != v.end()) {
           mym[*(end++)]++;
        }
        cout << (end - beg) << endl;
        if(mym.size() == m) flats = min(flats, end - beg);
        if(mym[*beg] == 1) {
            mym.erase(beg);
        }
        else {
            mym[*beg]--;
        }
        beg++;
    }
    cout << flats;
}