#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
vector<long long> trans(const vector<long long>& a, long long sub) {
vector<long long> na = a;
na.pop_back();
if (a.back() - sub > 1) {
long long val = (a.back() - sub) / 2;
if (na.size() == 0) na.push_back(val);
else na.back() += val;
}
return na;
}
map<pair<int, long long>, long long> f;
long long solve(long long x, vector<long long> a, int pos) {
if (a.size() == 0) return 1;
if (f.count({pos, a.back()})) return f[{pos, a.back()}];
long long ret = 0;
if (a.back() >= x) {
ret += solve(x, trans(a, x), pos + 1);
}
ret += solve(x, trans(a, 0), pos + 1);
return f[{pos, a.back()}] = ret;
}
vector<long long> arr;
long long solve2(long long x, long long last, int pos) {
if ((int) arr.size() <= pos && last < x) return 1;
if (f.count({pos, last})) return f[{pos, last}];
long long ret = 0;
if (last >= x) {
long long nlast = (pos + 1 < (int) arr.size() ? arr[pos + 1] : 0) + (last - x) / 2;
ret += solve2(x, nlast, pos + 1);
}
long long nlast = (pos + 1 < (int) arr.size() ? arr[pos + 1] : 0) + last / 2;
ret += solve2(x, nlast, pos + 1);
return f[{pos, last}] = ret;
}
// long long solve2(long long x, vector<long long> a) {
// long long sum = 0;
// for (int i = (int) a.size() - 1; i >= 0; --i) {
// sum *= 2;
// sum += a[i];
// }
// }
long long count_tastiness(long long x, vector<long long> a) {
f.clear();
// for (int i = 0; i < (int) a.size(); ++i) {
// if (a[i] > x) {
// long long add = (a[i] - x) / 2;
// a[i] = x + ((a[i] - x) & 1);
// if (i + 1 == (int) a.size())
// a.push_back(add);
// else
// a[i + 1] += add;
// }
// }
// reverse(a.begin(), a.end());
arr = a;
return solve2(x, arr[0], 0);
}
