#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
int count_tastiness(int x, vi a)
{
a.resize(60, 0);
//5e7 primes below 10^9
int sum = 0;
loop(i, x)
sum += a[i] * (1LL << i);
int result = 0;
loop(y, sum)
{
//vi b = a;
bool success = true;
int count = 0;
loop(bit, 60)
{
count += a[bit] * (1LL << bit);
if ((y & (1LL << bit)) == 0)
continue;
if (count < x * (1LL << bit))
{
success = false;
break;
}
count -= x * (1LL << bit);
}
result += success;
}
return result;
}
//signed main()
//{
// cout << count_tastiness(3, { 5, 2, 1 }) << endl;
//
// return 0;
//}
