#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N; int fu[1024],fo[1024]; int tu[1024],to[1024]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N; fu[1]=1; FOR(i,N) { cin>>x; ZERO(to); ZERO(tu); FOR(j,1024) { if(fu[j]) { tu[j&x]=1; if(j*x>=1024) { to[(j*x)&1023]++; } else { tu[j*x]=1; } } if(fo[j]) { tu[j&x]=1; to[(j*x)&1023]+=fo[j]; } } swap(to,fo); swap(tu,fu); int sum=0; FOR(j,1024) sum+=fo[j]+fu[j]; cout<