//In the name of God
#include<bits/stdc++.h>
#include "biscuits.h"
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll maxn = 2e5 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const ll lg = 130;
#define Mp make_pair
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define Sz(x) ll((x).size())
ll ptr[maxn];
ll dp[lg][maxn];
long long count_tastiness(long long x, vector<long long> a){
a.resize(lg, 0);
for(ll i = 0; i + 1 < lg; i++){
ptr[i] = 0;
ll y = max(0ll, (a[i] - x) / 2);
a[i] -= y * 2;
a[i + 1] += y;
}
ll ls = 0;
for(ll i = 0; i < lg; i++){
if(a[i]) ls = i;
}
dp[0][ptr[0]++] = 0;
for(ll i = 0; i < ls + 2; i++){
for(ll o = 0; o < ptr[i]; o++){
ll j = dp[i][o];
dp[i + 1][ptr[i + 1]++] = ((j + a[i]) >> 1);
if(j + a[i] >= x) dp[i + 1][ptr[i + 1]++] = ((j + a[i] - x) >> 1);
}
}
return ptr[ls + 1];
}
