#include <bits/stdc++.h>

using i64 = long long;

template<class T>
constexpr T power(T a, i64 b) {
    T res {1};
    for (; b; b /= 2, a *= a) {
        if (b % 2) {
            res *= a;
        }
    }
    return res;
}
  
constexpr i64 mul(i64 a, i64 b, i64 p) {
    i64 res = a * b - i64(1.L * a * b / p) * p;
    res %= p;
    if (res < 0) {
        res += p;
    }
    return res;
}
  
template<i64 P>
struct MInt {
    i64 x;
    constexpr MInt() : x {0} {}
    constexpr MInt(i64 x) : x {norm(x % getMod())} {}
     
    static i64 Mod;
    constexpr static i64 getMod() {
        if (P > 0) {
            return P;
        } else {
            return Mod;
        }
    }
    static void setMod(i64 Mod_) {
        Mod = Mod_;
    }
    constexpr i64 norm(i64 x) const {
        if (x < 0) {
            x += getMod();
        }
        if (x >= getMod()) {
            x -= getMod();
        }
        return x;
    }
    constexpr i64 val() const {
        return x;
    }
    constexpr MInt operator-() const {
        MInt res;
        res.x = norm(getMod() - x);
        return res;
    }
    constexpr MInt inv() const {
        return power(*this, getMod() - 2);
    }
    constexpr MInt &operator*=(MInt rhs) & {
        if (getMod() < (1ULL << 31)) {
            x = x * rhs.x % int(getMod());
        } else {
            x = mul(x, rhs.x, getMod());
        }
        return *this;
    }
    constexpr MInt &operator+=(MInt rhs) & {
        x = norm(x + rhs.x);
        return *this;
    }
    constexpr MInt &operator-=(MInt rhs) & {
        x = norm(x - rhs.x);
        return *this;
    }
    constexpr MInt &operator/=(MInt rhs) & {
        return *this *= rhs.inv();
    }
    friend constexpr MInt operator*(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res *= rhs;
        return res;
    }
    friend constexpr MInt operator+(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res += rhs;
        return res;
    }
    friend constexpr MInt operator-(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res -= rhs;
        return res;
    }
    friend constexpr MInt operator/(MInt lhs, MInt rhs) {
        MInt res = lhs;
        res /= rhs;
        return res;
    }
    friend constexpr std::istream &operator>>(std::istream &is, MInt &a) {
        i64 v;
        is >> v;
        a = MInt(v);
        return is;
    }
    friend constexpr std::ostream &operator<<(std::ostream &os, const MInt &a) {
        return os << a.val();
    }
    friend constexpr bool operator==(MInt lhs, MInt rhs) {
        return lhs.val() == rhs.val();
    }
    friend constexpr bool operator!=(MInt lhs, MInt rhs) {
        return lhs.val() != rhs.val();
    }
    friend constexpr bool operator<(MInt lhs, MInt rhs) {
        return lhs.val() < rhs.val();
    }
};
  
template<>
i64 MInt<0>::Mod = 998244353;
  
constexpr int P = 998244353;
using Mint = MInt<P>;

const int B = 16 + 1;
struct LinearBasis {
    int ex, m;
    std::vector<i64> bit, b;
    LinearBasis() {
        std::vector<i64> t;
        init(t);
    }
    template<class T>
    LinearBasis(std::vector<T> &a) {
        init(a);
    }
    template<class T>
    void init(std::vector<T> &a) {
        this->ex = 0;
        bit.assign(B, 0);
        for (auto &x : a) {
            insert(x);
        }
        // build();
    }
    void build() {
        b.clear();
        for (int i = 0; i < B; i++) {
            if (!bit[i]) {
                continue;
            }
            b.emplace_back(bit[i]);
        }
        this->m = b.size();
    }

    bool insert(i64 x) {
        for (int i = B - 1; i >= 0; i--) {
            if (x >> i & 1) {
                if (!bit[i]) {
                    bit[i] = x;
                    // build();
                    return true;
                } else {
                    x ^= bit[i];
                }
            }
        }
        this->ex++;
        return false;
    }
    i64 queryMin(i64 x) {
        for (int i = B - 1; i >= 0; i--) {
            x = std::min(x, bit[i] ^ x);
        }
        return x;
    }
    i64 queryMax(i64 x) {
        for (int i = B - 1; i >= 0; i--) {
            x = std::max(x, bit[i] ^ x);
        }
        return x;
    }
    i64 kth(i64 k) { // the kth smallest element in set
        // multiset: k >> this->ex
        if (this->ex > 0) {
            k--;
        }
        if (k > (1LL << m) - 1) {
            return -1;
        }
        i64 x = 0;
        for (int i = m - 1; i >= 0; i--) {
            if (k >> i & 1) {
                x = std::max(x, x ^ b[i]);
            } else {
                x = std::min(x, x ^ b[i]);
            }
        }
        return x;
    }
};

const int N = 2E5 + 1;
Mint pw[N];

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }

    LinearBasis L0(a);
    std::vector<int> cnt(n + 1);
    for (int i = 0; i < n; i++) {
        cnt[a[i]]++;
    }
    Mint ans = pw[L0.ex] - 1;

    std::sort(a.begin(), a.end());
    a.erase(std::unique(a.begin(), a.end()), a.end());
    const int m = a.size();
    const int mx = a.back();

    std::vector<LinearBasis> L(mx + 1);
    for (auto &x : a) {
        for (int j = x; j <= mx; j += x) {
            L[j].insert(x);
            L[j].ex += (cnt[x] - 1);
        }
    }

    for (auto &x : a) {
        ans += pw[L[x].ex];
    }
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    pw[0] = 1;
    for (int i = 1; i < N; i++) {
        pw[i] = pw[i - 1] * 2;
    }

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}