// TLE: naive DFS

#include <deque>
#include <iostream>
#include <vector>

std::pair<long long, std::vector<int>> naive(int n, const std::vector<int>& p) {
    long long min_inv = 1LL << 60;
    std::vector<int> ans;

    std::deque<int> dq;
    auto dfs = [&](auto dfs, int i, long long inv) -> void {
        if (inv > min_inv) return;

        if (i == n) {
            std::vector<int> a(dq.begin(), dq.end());
            if (inv < min_inv or a < ans) {
                min_inv = inv;
                ans = std::move(a);
            }
            return;
        }

        const int v = p[i];
        int cnt_lt = 0, cnt_gt = 0;
        for (int e : dq) ++(e < v ? cnt_lt : cnt_gt);
        dq.push_front(v);
        dfs(dfs, i + 1, inv + cnt_lt);
        dq.pop_front();

        if (i == 0) return;

        dq.push_back(v);
        dfs(dfs, i + 1, inv + cnt_gt);
        dq.pop_back();
    };
    dfs(dfs, 0, 0LL);
    return { min_inv, ans };
}

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

    int t;
    std::cin >> t;
    while (t--) {
        int n;
        std::cin >> n;

        std::vector<int> p(n);
        for (auto&& e : p) std::cin >> e, --e;

        auto [inv, a] = naive(n, p);

        std::cout << inv << '\n';
        for (int i = 0; i < n; ++i) {
            if (i) std::cout << ' ';
            std::cout << a[i] + 1;
        }
        std::cout << '\n';
    }
}