#include <iostream>
#include <chrono>
#include <random>
#include <algorithm>
#include <deque>
#include <cstring>
#include <array>
#include <set>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2")
#define all(x)x.begin(),x.end()
#define pack(x)sort(all(x));x.erase(unique(all(x)),x.end())
#define gi(x,v)lower_bound(all(x),v)-x.begin()
using namespace std;
using ll=long long;
struct hash_string{
    int v[200'010];
    int pw[200'010];
    int p1=3423557;
    void init(string s,char k){
        pw[0]=1;
        for(int i=1;i<=s.length();i++){
            pw[i]=pw[i-1]*p1;
            v[i]=v[i-1]*p1+(s[i-1]==k?5471:0);
        }
    }int get(int l,int r){
        l++;r++;
        return v[r]-v[l-1]*pw[r-l+1];
    }
}tree[26];
int N;
vector<int> v;
int ord[200'010][26];
int num[200'010][26];
string str;
bool cmp(const int a,const int b){
    int l=1,r=N-max(a,b)+1;
    while(l<=r){
        int mid=l+r>>1;
        bool isSame=true;
        for(int i=0;i<26;i++){
            if(tree[ord[a][i]].get(a,a+mid-1)!=tree[ord[b][i]].get(b,b+mid-1)){
                isSame=false;
                break;
            }
        }if(isSame)l=mid+1;
        else r=mid-1;
    }int same=l-1;
    if(same==N-max(a,b)+1)return a>b;
    return num[a][str[a+same]-'a']<num[b][str[b+same]-'a'];
}
void dnc(int s,int e){
    if(s>=e)return;
    int mid=s+e>>1;
    dnc(s,mid);dnc(mid+1,e);
    vector<int> ret;
    int pv=s,ppv=mid+1;
    while(pv!=mid+1&&ppv!=e+1){
        if(cmp(v[pv],v[ppv]))ret.push_back(v[pv++]);
        else ret.push_back(v[ppv++]);
    }
    while(pv!=mid+1)ret.push_back(v[pv++]);
    while(ppv!=e+1)ret.push_back(v[ppv++]);
    for(int i=s;i<=e;i++)v[i]=ret[i-s];
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin>>n;N=n-1;
    cin>>str;
    if(n!=str.length())return 1;
    vector<pair<int,int>>sd;
    for(int i=0;i<26;i++){
        tree[i].init(str,i+'a');
        sd.push_back({n+1,i});
    }
    for(int i=(int)str.length()-1;i>=0;i--){
        sd[str[i]-'a'].first=i;
        vector<pair<int,int>> dup=sd;
        sort(all(dup));
        for(int j=0;j<26;j++){
            ord[i][j]=dup[j].second;
            num[i][dup[j].second]=j;
        }
    }
    vector<int> v2,v3,v4;
    for(int i=0;i+2<str.length();i++){
        if(str[i]==str[i+1]){
            if(str[i]==str[i+2])v.push_back(i);
            else v2.push_back(i);
        }
        else {
            if(str[i]==str[i+2])v3.push_back(i);
            else v4.push_back(i);
        }
    }
    cout<<str.length()<<' ';
    if(str[n-2]==str[n-1])cout<<(int)str.length()-1<<' ';
    dnc(0,(int)v.size()-1);
    for(auto i:v)cout<<i+1<<' ';
    swap(v,v2);
    dnc(0,(int)v.size()-1);
    for(auto i:v)cout<<i+1<<' ';
    if(str[n-2]!=str[n-1])cout<<(int)str.length()-1<<' ';
    swap(v,v3);
    dnc(0,(int)v.size()-1);
    for(auto i:v)cout<<i+1<<' ';
    swap(v,v4);
    dnc(0,(int)v.size()-1);
    for(auto i:v)cout<<i+1<<' ';
}