problem/1859/A

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

int n;
vector <int> a;

int slv() {
    cin >> n;
    a.resize(n);
    for (int &i: a) cin >> i;
    for (int i = 0; i < n; ++i) {
        bool ok = 1;
        for (int j = 0; j < n; ++j) {
            if (a[j] == a[i]) {
                continue;
            }
            if (a[j] % a[i] == 0) {
                ok = 0;
                break;
            }
        }
        if (ok) {
            return i;
        }
    }
}

/*
7
1 7 7 2 9 1 4
2 5
7 7
1 2 9 1 4
*/

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    for (int go = 0; go < t; ++go) {
        int k = slv();
        if (k == -1) {
            cout << -1 << "\n";
            continue;
        }
        int cnt = 0;
        for (int i = 0; i < n; ++i) {
            if (a[i] == a[k]) {
                cnt++;
            }
        }
        if (cnt == n) {
            cout << -1 << '\n';
            continue;
        }
        cout << n - cnt << ' ' << cnt << "\n";
        for (int i = 0; i < n; ++i) {
            if (a[i] != a[k]) {
                cout << a[i] << ' ';
            }
        } cout << "\n";
        for (int i = 0; i < n; ++i) {
            if (a[i] == a[k]) {
                cout << a[i] << ' ';
            }
        } cout << "\n";
    }
}