#include "biscuits.h"
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
#ifdef DEBUG
auto& operator<<(auto &os, const pair<auto,auto> &p) {
return os<<"("<<p.first<<", "<<p.second<<")";
}
auto& operator<<(auto &os, const auto &v) {
os<<"{";
for(auto it=begin(v);it!=end(v);++it) {
if(it != begin(v)) os<<", ";
os<<(*it);
}
return os<<"}";
}
void dbg_out(auto... x) {
((cerr<<' '<<x), ...) << endl;
}
#define dbg(x...) cerr<<"("<<#x<<"):", dbg_out(x);
#else
#define dbg(...)
#endif
typedef vector<ll> vll;
const ll inf = ll(1e18) + 7;
const ll maxv = 100000 + 7;
const ll k = 62;
ll num(ll val, vll a) {
if(val == 0) return inf;
// if(val >= (1LL<<k)) return 0;
vll needed(k, 0);
rep(i,0,k)
if((val>>ll(i)) & 1LL)
needed[i] = 1;
ll result = 0;
while(true) {
int mini = -1;
rep(i,0,k) {
if(needed[i] == 0) continue;
if(mini == -1 || (a[i] / needed[i]) < (a[mini] / needed[mini]))
mini = i;
}
if(mini == -1) break;
ll res = a[mini] / needed[mini];
result += res;
if(mini == 0) break;
rep(i,0,k) a[i] -= res * needed[i];
needed[mini-1] += needed[mini] * 2;
needed[mini] = 0;
}
return result;
}
ll count_tastiness(ll x, vll a) {
a.resize(k);
ll res = 0;
rep(i,0,100007) {
bool poss = num(i, a) >= x;
res += poss;
}
return res;
}
