#include<bits/stdc++.h>
using namespace std;
const int N=5005;

char buf[1<<23],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
int read(){
    int s=0,w=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();};
    while(isdigit(ch))s=s*10+(ch^48),ch=getchar();
    return s*w;
}

int f[N][N],g[N][N],lp[N][N],rp[N][N],L[N],R[N];
char s[N];
int n;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    cin>>n>>(s+1);

    for(int i=1;i<=n;++i){
        f[i][i]=1,g[i][i]=0,lp[i][i]=rp[i][i]=i;
        L[i]=R[i]=i;
        while(s[L[i]-1]!=s[R[i]+1])--L[i],++R[i];
    }

    for(int r=1;r<=n;++r){
        for(int l=r-1;l;--l){
            
            if(((r-l+1)&1)&&L[(l+r)/2]<=l)
                f[l][r]=f[l][(l+r)/2-1]+1,
                g[l][r]=g[l][(l+r)/2-1],
                lp[l][r]=rp[l][r]=(l+r)/2;
            else {
                lp[l][r]=lp[l][r-1];
                rp[l][r]=rp[l+1][r];

                f[l][r]=min(f[lp[l][r]+1][r],f[l][rp[l][r]-1])+1;
                g[l][r]=1e9;
                if(f[l][r]==f[lp[l][r]+1][r]+1)
                    g[l][r]=min(g[l][r],g[lp[l][r]+1][r]+abs(l+r-2*lp[l][r]));
                if(f[l][r]==f[l][rp[l][r]-1]+1)
                    g[l][r]=min(g[l][r],g[l][rp[l][r]-1]+abs(l+r-2*rp[l][r]));
            }
        }
    }

    cout<<f[1][n]<<" "<<g[1][n]<<endl;
    return 0;
}