#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

const int MOD = 998244353;

void add_to_b(vector<int> &b, int &nrb, int x) {
  for (int bit = 20; bit >= 0; --bit) {
    if (x & (1 << bit)) {
      if (b[bit] == 0) {
        b[bit] = x;
        ++nrb;
        continue;
      }
      x ^= b[bit];
    }
  }
}

int lgput(int x, int p) {
  int ans = 1, aux = x;

  for (int i = 1; i <= p; i <<= 1) {
    if (i & p)
      ans = 1LL * ans * aux % MOD;
    aux = 1LL * aux * aux % MOD;
  }

  return ans;
}

void solve() {
  int n;
  cin >> n;
  vector<int> f(n + 1, 0);
  vector<int> cnt(n + 1, 0);
  vector<int> nr(n + 1, 0);
  vector<vector<int>> b(n + 1, vector<int> (21, 0));
  for (int i = 1; i <= n; ++i) {
    int x;
    cin >> x;
    ++f[x];
  }

  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    if (!f[i])
      continue;
    add_to_b(b[0], nr[0], i);
    for (int j = i * 2; j <= n; j += i) {
      add_to_b(b[j], nr[j], i);
      cnt[j] += f[i];
    }
    // 2 ^ (numarul de numere - cate ai in baza) * 2^(nr de i - 1)
    for (int j = 1; j <= f[i]; ++j) {
      ans = (1LL * ans + 1LL * lgput(2, cnt[i] - nr[i]) * lgput(2, (j - 2))) % MOD;
    }
  }
  ans = (1LL * ans + 1LL * lgput(2, n - nr[0]) - 1 + MOD) % MOD;

  cout << ans << '\n';
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
  cin >> t;
  while (t--)
    solve();

  return 0;
}