#include "biscuits.h"
#ifdef NYAOWO
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;
const int MAXK = 60;
int a[MAXK + 10];
long long count_tastiness(long long x, std::vector<long long> _a) {
memset(a, 0, sizeof(a));
int k = sz(_a);
For(i, 0, k - 1) {
a[i] = _a[i];
}
int ans = 0;
priority_queue<int, vector<int>, greater<int>> pq;
pq.emplace(0);
while(sz(pq)) {
int owo = pq.top(); pq.pop();
int hibit = k;
while(hibit >= 0 && (1ll << hibit) > owo) hibit--;
int cur = 0;
For(i, 0, k - 1) {
cur = cur / 2 + a[i];
if(owo & (1ll << i)) cur -= x;
if(i > hibit && cur >= x) {
pq.emplace(owo | (1ll << i));
}
}
// cerr << owo << " " << cur << "\n";
ans++;
}
cerr << "\n";
return ans;
}
