#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define LL long long
int que[2000020],seq[2000020],mn[1000010];
char opt[1000002];
inline LL abs(LL a){
    return a>0?a:-a;
}
inline LL max(LL a,LL b){
    return a>b?a:b;
}
inline LL min(LL a,LL b){
    return a<b?a:b;
}
int main(){
    LL n,p,q,x,y;
    int i,h,t;
    scanf("%lld %lld %lld %lld %lld",&n,&p,&q,&x,&y);
    scanf("%s",opt+1);
    for(i=n<<1;i>n;--i)seq[i]=seq[i+1]+(opt[i-n]=='+'?1:-1);
    for(i=n;i;--i)seq[i]=seq[i+1]+(opt[i]=='+'?1:-1);
    que[0]=0;
    h=1,t=0;
    for(i=n<<1;i;--i){
        while(h<=t&&seq[i]>seq[que[t]])--t;//seq[i]-seq[que[h]]>seq[que[t]]-seq[que[h]]
        que[++t]=i;
        while(h<=t&&que[h]-i>=n)++h;
        if(i<=n)mn[i]=seq[i]-seq[que[h]]; //你不能用head更新min，只能倒序用i
    }
    LL all=seq[n+1],tmp=(q-p-all)/2,ans=1e16,cst;
    for(i=0;i<n;i++){//枚举起点与枚举旋转次数不同
        cst=x*abs(tmp)+y*(LL)i;
        if(i==0){
            mn[1]+=p+max(tmp,0)*2;
            if(mn[1]<0)cst+=2*x*((1-mn[1])/2);
        }else{
            mn[n-i+1]+=p+max(tmp,0)*2;
            if(mn[n-i+1]<0)cst+=2*x*((1-mn[n-i+1])/2);
        }
        ans=min(ans,cst);
    }
    printf("%lld",ans);
    return 0;
}