#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 1e5 + 5;
#define int long long
#define MAX LONG_LONG_MAX
int ar[N];
void solve()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n + 1; i++)
        ar[i] = 0;
    queue<int> q;

    for (int i = 2; i <= n - 1; i++)
    {
        if (i % 2)
        {
            for (int j = 2; j * i <= n; j++)
            {
                if (ar[i * j])
                    continue;
                q.push(i);
                q.push(i * j);
            }
        }
        else
        {
            if (ar[i])
                continue;
            int j = i;
            for (j = i + 2; j <= n; j += 2)
                if (ar[j])
                    continue;
            if (j > n)
                continue;
            ar[i] = ar[j] = 1;
            q.push(i);
            q.push(j);
        }
    }
    cout << q.size() / 2 << " ";
    while (!q.empty())
    {
        cout << q.front() << " ";
        q.pop();
    }
    cout << endl;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int tcase;
    cin >> tcase;

    while (tcase--)
        solve();

    return 0;
}