#include "biscuits.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
ll dp[61];
ll cnt[61];
ll count_tastiness(ll x, vl a)
{
rep(i,61) cnt[i] = 0;
rep(i,siz(a))
{
cnt[i] = a[i];
}
rep(bit,61)
{
if(bit != 0) dp[bit] = dp[bit-1];
else dp[bit] = 1;
__int128_t zost = x;
int bit2 = bit;
int prv = bit;
while(bit2 >= 0)
{
zost -= cnt[bit2];
if(zost <= 0)
{
if(bit2 > 0)
{
dp[bit] += dp[bit2-1];
}
else
{
dp[bit]++;
}
if(prv == bit2) break;
zost += cnt[bit2];
zost = x + (zost);
prv = bit2;
}
else
{
zost *= 2;
bit2--;
}
}
}
return dp[60];
}
