#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<cctype>

#include<queue>

#define maxn 5030

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

struct Edge{

    int from,next,to,val,dis;

}edge[maxn*];

int head[maxn],num;

inline void addedge(int from,int to,int val,int dis){

    edge[++num]=(Edge){from,head[from],to,val,dis};

    head[from]=num;

}

inline void add(int from,int to,int val,int dis){

    addedge(from,to,val,dis);

    addedge(to,from,,-dis);

}

inline int count(int i){    return i&?i+:i-;    }

int dis[maxn];

int pre[maxn];

bool vis[maxn];

int flow[maxn];

int Start,End;

int spfa(){

    memset(dis,/,sizeof(dis));    int pinf=dis[];

    dis[Start]=;    flow[Start]=0x7fffffff;

    queue<int>q; q.push(Start);

    while(!q.empty()){

        int from=q.front();    q.pop();    vis[from]=;

        for(int i=head[from];i;i=edge[i].next){

            int to=edge[i].to;

            if(edge[i].val==||dis[to]<=dis[from]+edge[i].dis)    continue;

            dis[to]=dis[from]+edge[i].dis;

            pre[to]=i;    flow[to]=min(flow[from],edge[i].val);

            if(vis[to])    continue;

            vis[to]=;    q.push(to);

        }

    }

    if(dis[End]==pinf)    return ;

    int now=End;

    while(now!=Start){

        int ret=pre[now];

        edge[ret].val-=flow[End];    edge[count(ret)].val+=flow[End];

        now=edge[ret].from;

    }

    return (long long)dis[End]*flow[End];

}

int r[maxn];

int main(){

    int N=read();    End=N*+;

    for(int i=;i<=N;++i){

        r[i]=read();

        add(Start,i+N,r[i],);

        add(i,End,r[i],);

        add(i,i+N,0x7fffffff,);

    }

    int p=read(),m=read(),f=read(),n=read(),s=read();

    for(int i=;i<=N;++i){

        add(Start,i,0x7fffffff,p);

        if(i!=N)    add(i,i+,0x7fffffff,);

        if(i+m>N)    continue;

        add(i+N,i+m,0x7fffffff,f);

        if(i+n>N)    continue;

        add(i+N,i+n,0x7fffffff,s);

    }

    long long ans=;

    while(){

        long long now=spfa();

        if(now==)    break;

        ans+=now;

    }

    printf("%lld\n",ans);

    return ;

}