#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define N 4400
using namespace std;
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0;char ch=gc();
while(ch<'0'||ch>'9') ch=gc();
while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
return x;
}
int num=1,h[N],n,m,T,p,ff,s,nn,pre[N],path[N];bool flag[N];long long f[N],ans;
struct node{
int y,z,c,next;
}data[N*N];
inline void insert1(int x,int y,int z,int c){
data[++num].y=y;data[num].next=h[x];data[num].z=z;data[num].c=c;h[x]=num;
data[++num].y=x;data[num].next=h[y];data[num].z=0;data[num].c=-c;h[y]=num;
}
inline bool spfa(){
memset(flag,0,sizeof(flag));flag[0]=1;queue<int>q;q.push(0);memset(f,127,sizeof(f));f[0]=0;memset(pre,-1,sizeof(pre));
while(!q.empty()){
int x=q.front();q.pop();flag[x]=0;
for (int i=h[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z,c=data[i].c;
if (f[x]+c<f[y]&&z){
f[y]=f[x]+c;pre[y]=x;path[y]=i;
if (!flag[y]) flag[y]=1,q.push(y);
}
}
}if (pre[T]==-1) return 0;else return 1;
}
int main(){
//freopen("loj.in","r",stdin);
n=read();T=n*2+1;
for (int i=1;i<=n;++i){
int r=read();if(i<n) insert1(i,i+1,inf,0);
insert1(0,i,r,0);insert1(i+n,T,r,0);
}p=read();m=read();ff=read();nn=read();s=read();
for (int i=1;i<=n;++i){
insert1(0,i+n,inf,p);
if (i+nn<=n) insert1(i,i+nn+n,inf,s);
if (i+m<=n) insert1(i,i+m+n,inf,ff);
}ans=0;
while(spfa()){
int now=T,minn=inf;
while(now) minn=min(minn,data[path[now]].z),now=pre[now];now=T;
while(now){ans+=(long long)minn*data[path[now]].c;data[path[now]].z-=minn;data[path[now]^1].z+=minn;now=pre[now];}
}printf("%lld",ans);
return 0;
}