#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
class noo{
public:
    int x,gl;
    double pj;
}a[15];
int n,s=0,ss=0;
void init()
{
    for(int i=1;i<=10;i++)
    {
        cin>>a[i].x;
        a[i].pj=a[i].x/double(i);
        a[i].gl=int(i);
    }
}
int hhh(noo a,noo b)
{
    if(a.pj>=b.pj)
        return 0;
    if(a.pj<b.pj)
        return 1;
}
int main()
{
    freopen("busses.in","r",stdin);
    freopen("busses.out","w",stdout);
    init();
    cin>>n;
    sort(a+1,a+11,hhh);
    int i=1;
    while(n>=0)
    {
        if(n>=a[i].gl&&ss<=n)
        {
            s=s+a[i].x;
           ss=ss+a[i].gl;
        }
        else
            for(int i=2;i<=10;i++)
                if(a[i].gl<=n)
                {
                   s=s+a[i].x;
                   ss=ss+a[i].gl;
                   break;
                }
        n=n-a[i].gl;
    }
    cout<<s;
    return 0;
}