#ifndef hwe
#include "souvenirs.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
unsigned long long random(unsigned long long l, unsigned long long r) {
return uniform_int_distribution<unsigned long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
namespace Jury {
int n;
vector<int> P, Q;
void test() {
cin >> n;
P.assign(n, 0);
Q.assign(n, 0);
for (auto &x : P) cin >> x;
}
pair<vector<int>, long long> transaction(long long M) {
if (M >= P[0]) {
cerr << "Invalid transaction: M > P0" << '\n';
exit(0);
}
if (M < P[n - 1]) {
cerr << "Invalid transaction: M < P[n - 1]" << '\n';
exit(0);
}
vector<int> L; ll R = M;
for (int i = 0; i < n; ++i) if (R >= P[i]) {
R -= P[i], ++Q[i];
L.emplace_back(i);
}
return make_pair(L, R);
}
}
#ifdef hwe
pair<vector<int>, ll> transaction(ll M) {
return Jury::transaction(M);
}
#endif
namespace sub4 {
void buy_souvenirs(int n, ll P0) {
assert(n == 3);
auto [L, R] = transaction(P0 - 1);
assert(!L.empty() && L[0] == 1);
if (L.size() == 1) { // only buy P1
ll P1 = (P0 - 1) - R;
transaction(P1 - 1);
transaction(P1 - 1);
return;
}
// Buy P1 and P2 -> P1 + P2 = (P0 - 1) - R -> P1 >= sum / 2 + 1, P2 <= sum / 2
ll sum = (P0 - 1) - R;
transaction(sum / 2);
}
}
void buy_souvenirs(int n, ll P0) {
if (n == 3) return sub4::buy_souvenirs(n, P0);
vector<ll> P(n, 0);
vector<int> Q(n, 0);
P[0] = P0;
for (int i = 1; i < n; ++i) {
auto [L, R] = transaction(P[i - 1] - 1);
for (auto &x : L) ++Q[x];
if (L.size() == 1 && R == 0) P[i] = P[i - 1] - 1;
else P[i] = P[i - 1] - 2;
}
for (int i = 1; i < n; ++i) {
while (Q[i] < i) transaction(P[i]), ++Q[i];
}
}
#ifdef hwe
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
Jury::test();
buy_souvenirs(Jury::n, Jury::P[0]);
for (int i = 0; i < Jury::n; ++i) {
cerr << Jury::Q[i] << ' ';
}
cerr << '\n';
return 0;
}
#endif
// Subtask 3
