#include <bits/stdc++.h>
#include "biscuits.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define N 100005
#define PB push_back
#define sz(x) int(x.size())
#define F first
#define M ll(1e9 + 7)
#define S second
#define all(x) x.begin(), x.end()
#define endl '\n'
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
//typedef tree <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
ll f[150], b[150];
long long count_tastiness(long long x, vector<long long> a) {
while (a.size() < 60) a.push_back(0);
vector<long long> b;
for (long long i: a) b.push_back(i);
for (int i = 1; i < 60; ++i) b[i] += b[i - 1] / 2;
long long dp[61];
dp[0] = 1;
for (int i = 0; i < 60; ++i) {
if (b[i] < x) {
dp[i + 1] = dp[i];
continue;
}
long long dpv = 0, k = max(0LL, x - a[i]) * 2;
for (int j = i; j > 0; --j) {
if (b[j - 1] >= k + x) dpv += dp[j - 1], k = max(0LL, k + x - a[j - 1]) * 2;
else k = max(0LL, k - a[j - 1]) * 2;
}
if (k == 0) ++dpv;
dp[i + 1] = dp[i] + dpv;
}
return dp[60];
}
//int main()
//{
// iostream::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//
// // freopen("1.in", "r", stdin); //freopen("fcolor.out", "w", stdout);
//
// cout << count_tastiness(1, {18}) << endl;
//}
