#include "Anna.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
namespace Anna_solver{
const int M=2000;
int Declare(){
return M;
}
pair<vector<int>, vector<int>> Anna(unsigned long long A){
vector<int> v;
vector<int> vv;
for (int i=0; i<64; ++i){
if (A>>i&1) vv.push_back(0);
vv.push_back(1);
}
v.push_back(1);
while ((int)v.size()+(int)vv.size()<=M) v.insert(v.end(), vv.begin(), vv.end());
return {vector<int>(v.size(), 0), v};
}
}
int Declare() {
return Anna_solver::Declare();
}
std::pair<std::vector<int>, std::vector<int> > Anna(long long A) {
return Anna_solver::Anna(A);
}
#include "Bruno.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
namespace Bruno_solver{
const int M=2000;
long long Bruno(vector<int> v){
unsigned long long ans=0;
vector<int> mn(64, 100), id;
for (int i=0; i<(int)v.size(); ++i){
if (v[i]==1) id.push_back(i);
}
for (int i=0; i<(int)id.size()-1; ++i){
mn[i%64]=min(mn[i%64], id[i+1]-id[i]-1);
}
for (int i=0; i<64; ++i){
if (mn[i]) ans|=1ull<<i;
}
return ans;
}
}
long long Bruno(std::vector<int> u) {
return Bruno_solver::Bruno(u);
}
