#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> lim;
int k;

vector<int> convert(ll n){
    vector<int> r;
    while (n){
        r.push_back(n % k);
        n /= k;
    }
    return r;
}

bool ok(ll m, vector<int> n){
    vector<ll> req(k, 0);
    int power = 1;
    for (int i=0; i<n.size(); i++){
        req[0] += power * (m / (power * k));
        if (n[i] == 0) req[0] -= power;
        if (req[0] > lim[0]) return 0;
        for (int j=1; j<n[i]; j++){
            req[j] += power * (m / (power * k) + 1);
            if (req[j] > lim[j]) return 0;
        }
        for (int j=n[i]; j<k; j++){
            req[j] += power * (m / (power * k));
            if (req[j] > lim[j]) return 0;
        }
        power *= 3;
    }
    return true;
}

int main()
{
    cin >> k;
    lim.resize(k);
    for (ll &x : lim){
        cin >> x;
    }
    ll l = 2, r = 1e14;
    while (l + 1 < r){
        ll m = (l + r) / 2;
        if (ok(m, convert(m))){
            l = m;
        }
        else{
            r = m;
        }
    }
    cout << l - 1;
}