//
//  main.cpp
//  dance
//
//  Created by Yg on 2024/4/26.
//
#include <iostream>
//#include <stdio.h>
#include <math.h>
#include <cmath>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <fstream>
#include <string>
#include <map>
#include <unordered_map>
using namespace std;
#define int long long

#define il inline

#define rd read()

const int L = 2e5 + 10;
const int INF = 1e9 + 7;
const int momo = 998244353;
int head[L], w[L], nxt[L], edge[L], now = 0;
int cnt[L], deg[L], a[L];
il int read() {
    int res = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-')
            f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        res = res * 10 + c - '0';
        c = getchar();
    }
    return res * f;
}
il void addEdge(int u, int v, int x) {
    edge[++now] = v;
    w[now] = x;
    nxt[now] = head[u];
    head[u] = now;
}
queue<int> q;
il void topu() {
    q.push(1);
    cnt[1] = 1;
    while (!q.empty()) {
        int pos = q.front();
        q.pop();
        for (int i = head[pos]; i; i = nxt[i]) {
            int j = edge[i];
            cnt[j] += (cnt[pos] * w[i]) % momo;
            cnt[j] %= momo;
            if (deg[j])
                deg[j]--;
            if (deg[j] == 0)
                q.push(j);
        }
    }
}
signed main() {
    int t;
    t = rd;
    while (t--) {
        int n;
        n = rd;
        for (int i = 1; i <= n; ++i) {
            a[i] = rd;
        }
        // printf("out1\n");
        memset(head, 0, sizeof head);
        memset(cnt, 0, sizeof cnt);
        now = 0;
        for (int i = 1; i < n; ++i) {
            for (int j = i + 1; j <= n; ++j) {
                int f = a[i] & a[j];
                addEdge(i, j, f);
            }
        }
        // printf("out\n");
        topu();
        printf("%lld", cnt[n]);
    }

    return 0;
}