/* Problem URL: https://codeforces.com/contest/2147/problem/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

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

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

        vl fds(n);
        cin >> fds;

        map<ll, ll> c;
        map<ll, ll, greater<>> even;

        repv(i, fds) {
            if (i & 1) {
                c[i]++;
                if (i != 1) {
                    even[i - 1]++;
                }
            } else {
                even[i]++;
            }
        }

        vl freq;
        freq.reserve(c.size());

        repv(i, c) {
            freq.push_back(i.second);
        }

        sort(all(freq), greater<>());

        ll play[2] = {};

        rep(i, freq.size()) {
            play[i & 1] += freq[i];
        }

        auto itr = even.begin();

        while (itr != even.end()) {
            auto ne = next(itr);
            ll pro = ne == even.end() ? 0 : ne->first;
            ll diff = itr->first - pro;

            play[0] += (diff >> 1) * itr->second;
            play[1] += (diff >> 1) * itr->second;

            if (ne != even.end()) {
                ne->second += itr->second;
            }

            itr = ne;
        }

        cout << play[0] << ' ' << play[1] << '\n';
    }
}