#include using namespace std; #define rep(i, n) for (int i=0; i>j)&1) inv[S][i]++; } rep(t, N) { ll ndp[1<> L; while (L--) { int A; cin >> A; A--; rep(S, 1<>A)&1) continue; ndp[S|(1<