#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
template <typename T> struct Bit{
int N;
vector<T>bit;
void build(ll n){
N = n+5;
f(i,0,N){
bit.pb(0);
}
}
void upd(ll k,T x){
while(k < N){
bit[k] += x;
k += k & -k;
}
}
T query(ll k){
T ans = 0;
while(k >= 1){
ans += bit[k];
k -= k & -k;
}
return ans;
}
};
ll c(vll a){
ll ans = 0;
Bit<ll>b;
b.build(a.size() + 5);
f(j,0,(ll)a.size()){
ans += j - b.query(a[j]+1);
b.upd(a[j]+1,1);
}
return ans;
}
int main(void){
ll t;
cin>>t;
while(t--){
ll n;
cin>>n;
ll arr[n];
vll a[2];
ll posa = 0;
vll b;
f(i,0,n){
cin>>arr[i];
if(i < n/2 && arr[i] > n/2){
posa++;
b.pb(n + 1 - arr[i]);
}
arr[i] = min(arr[i],n + 1 - arr[i]);
a[i >= n/2].pb(arr[i]);
}
reverse(all(a[1]));
if(a[0] == a[1] && (posa % 2 == 0)){
cout<<c(a[0])<<" ";
cout<<"0\n";
}
else{
cout<<"-1\n";
}
}
}
