#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
#define int long long
using namespace std;
string s;
int n,a,b,c;
const int bs=37,mod=1e9+7;
vector<int> pre,fac;
map<int,int> dp;
int inv(int x){
return x==1?1:(inv(mod%x)*(mod-mod/x)%mod);
}
void init(){
pre.resize(n+5);
fac.resize(n+5);
fac[0]=1;
pre[0]=0;
for(int i=1;i<=n;i++){
fac[i]=fac[i-1]*bs%mod;
pre[i]=(pre[i-1]+fac[i]*(s[i-1]-'a'+s[i-1]*2))%mod;
}
}
int ha(int l,int r){
l++;
r++;
return (pre[r]-pre[l-1]+mod)*inv(fac[l])%mod;
}
signed main(){
AquA;
cin >> n >> s >> a >> b >> c;
init();
vector<vector<int> > g(n,vector<int>(n));
vector<int> p;
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
g[i][j]=ha(i,j);
p.push_back(g[i][j]);
}
}
sort(p.begin(),p.end());
p.erase(unique(p.begin(),p.end()),p.end());
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
g[i][j]=lower_bound(p.begin(),p.end(),g[i][j])-p.begin();
}
}
vector<vector<int> > from(n,vector<int>(n,-1));
for(int l=1;l<=n;l++){
map<int,int> m;
for(int j=0;j+l-1<n;j++){
if(m.find(g[j][j+l-1])!=m.end()){
from[j][j+l-1]=m[g[j][j+l-1]];
}
if(j-l+1>=0){
m[g[j-l+1][j]]=j-l+1;
}
}
}
vector<vector<int> > zzz(n,vector<int>(n,1e18));
for(int r=0;r<n;r++){
for(int l=r;l>=0;l--){
if(l==r){
zzz[l][r]=a;
}
else{
zzz[l][r]=min(zzz[l][r],min(zzz[l+1][r]+a,zzz[l][r-1]+a));
}
int j=from[l][r],t=2;
for(;j>=0;j=from[j][j+r-l]){
zzz[j][r]=min(zzz[j][r],zzz[l][r]+c*t+b+a*(r-j+1-(r-l+1)*t));
t++;
}
//cout << l << " " << r << " " << zzz[l][r] << "\n";
}
}
cout << zzz[0][n-1] << "\n";
return 0;
}
