713

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
#include <climits>

#include <list>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>
#include <map>

//#include <chrono>
//#include <fstream>
//#include <bits/stdc++.h>

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> veci;
typedef vector<bool> vecb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;

const int INF_I = 1e9;
const ll INF_LL = 1e18;

struct card {
    ll n_sec;
    int cost;
};

int main() {
    /*ifstream cin("in.txt");
    ofstream cout("out.txt");
    auto start_time = chrono::high_resolution_clock::now();*/

    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    int m;
    cin >> m;
    vector<card> vec(31);

    int pow = 1;
    for (int i = 0; i < 31; i++) {
        cin >> vec[i].n_sec;
        if (i > 0)
            vec[i].n_sec = max(vec[i].n_sec, vec[i - 1].n_sec * 2);
        vec[i].cost = pow;
        pow *= 2;
    }

    int res = (m / vec[30].n_sec) * vec[30].cost;
    m = (m + vec[30].n_sec) % vec[30].n_sec;

    vector<ll> sum(31);
    sum[0] = vec[0].n_sec;
    for (int i = 1; i < 31; i++)
        sum[i] += sum[i - 1] + vec[i].n_sec;

    for (int i = 30; i >= 0 && m > 0; i--)
        if (i == 0 || sum[i - 1] < m) {
            res += vec[i].cost;
            m -= vec[i].n_sec;
        }

    cout << res << endl;

    /*auto end_time = chrono::high_resolution_clock::now();
    chrono::duration<double> duration = end_time - start_time;
    cout << duration.count() << "\n";
    cin.close();
    cout.close();*/
    return 0;
}