#include<bits/stdc++.h>
using namespace std;
const int N=5005;
char s[N];
int n;
bool vis[N][N];
vector<int>L[N],R[N];
int f[N][N];
long long g[N][N];
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>(s+1);
    for(int i=1;i<=n;++i)vis[i][i]=1,L[i].emplace_back(i),R[i].emplace_back(i);
    for(int i=n;i;--i)
        for(int j=i+2;j<=n;j+=2){
            vis[i][j]=vis[i+1][j-1]&&(s[i]!=s[j]);
            if(vis[i][j]){
                L[i].emplace_back(j);
                R[j].emplace_back(i);
            }
        }
    memset(f,0x3f,sizeof f);
    memset(g,0x3f,sizeof g);
    for(int i=1;i<=n;++i){
        f[i][i]=1,g[i][i]=0;
        f[i+1][i]=0,g[i+1][i]=0;
    }
    f[1][0]=g[1][0]=0;
    for(int i=n;i;--i)
        for(int j=i+1;j<=n;j+=1){
            for(int k:L[i]){
                if(k>j)break;
                int m=(i+k)/2;
                if(f[i][j]>f[m+1][j]+1)
                    f[i][j]=f[m+1][j]+1,g[i][j]=g[m+1][j]+j-m-m+i;
                else if(f[i][j]==f[m+1][j]+1)
                    g[i][j]=min(g[i][j],g[m+1][j]+(j-m-m+i));
            }
            for(int k:R[j]){
                if(k<i)break;
                int m=(k+j)/2;
                if(f[i][j]>f[i][m-1]+1)
                    f[i][j]=f[i][m-1]+1,g[i][j]=g[i][m-1]-(j-m-m+i);
                else if(f[i][j]==f[i][m-1]+1)
                    g[i][j]=min(g[i][j],g[i][m-1]-(j-m-m+i));
            }
        }
    cout<<f[1][n]<<" "<<g[1][n]<<'\n';
    return 0;
}