#include <bits/stdc++.h>
using namespace std;
bool not_prime(int a) {
  for (int i = 2; i * i <= a; ++i) {
    if (a % i == 0) {
      return true;
    }
  }
  return false;
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int tot = accumulate(a.begin(), a.end(), 0);
  if (not_prime(tot)) {
    cout << n << '\n';
    for (int i = 0; i < n; ++i) {
      cout << i + 1 << ' ';
    }
    cout << '\n';
  } else {
    bool used = false;
    cout << n - 1 << '\n';
    for (int i = 0; i < n; ++i) {
      if (!used && a[i] % 2 == 1) {
        used = true;
      } else {
        cout << i + 1 << ' ';
      }
    }
    cout << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

### Prompt

Your task is to create a Cpp solution to the following problem:

A bow adorned with nameless flowers that bears the earnest hopes of an equally nameless person.

You have obtained the elegant bow known as the Windblume Ode. Inscribed in the weapon is an array of n (n ≥ 3) positive distinct integers (i.e. different, no duplicates are allowed).

Find the largest subset (i.e. having the maximum number of elements) of this array such that its sum is a composite number. A positive integer x is called composite if there exists a positive integer y such that 1 < y < x and x is divisible by y.

If there are multiple subsets with this largest size with the composite sum, you can output any of them. It can be proven that under the constraints of the problem such a non-empty subset always exists.

Input

Each test consists of multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100). Description of the test cases follows.

The first line of each test case contains an integer n (3 ≤ n ≤ 100) — the length of the array.

The second line of each test case contains n distinct integers a_{1},a_{2},...,a_{n} (1 ≤ a_{i} ≤ 200) — the elements of the array.

Output

Each test case should have two lines of output.

The first line should contain a single integer x: the size of the largest subset with composite sum. The next line should contain x space separated integers representing the indices of the subset of the initial array.

Example

Input


4
3
8 1 2
4
6 9 4 2
9
1 2 3 4 5 6 7 8 9
3
200 199 198


Output


2
2 1
4
2 1 4 3
9
6 9 1 2 3 4 5 7 8
3
1 2 3 

Note

In the first test case, the subset \\{a_2, a_1\} has a sum of 9, which is a composite number. The only subset of size 3 has a prime sum equal to 11. Note that you could also have selected the subset \\{a_1, a_3\} with sum 8 + 2 = 10, which is composite as it's divisible by 2.

In the second test case, the sum of all elements equals to 21, which is a composite number. Here we simply take the whole array as our subset.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
bool not_prime(int a) {
  for (int i = 2; i * i <= a; ++i) {
    if (a % i == 0) {
      return true;
    }
  }
  return false;
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int tot = accumulate(a.begin(), a.end(), 0);
  if (not_prime(tot)) {
    cout << n << '\n';
    for (int i = 0; i < n; ++i) {
      cout << i + 1 << ' ';
    }
    cout << '\n';
  } else {
    bool used = false;
    cout << n - 1 << '\n';
    for (int i = 0; i < n; ++i) {
      if (!used && a[i] % 2 == 1) {
        used = true;
      } else {
        cout << i + 1 << ' ';
      }
    }
    cout << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

```