#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

//* variant 1 : i == j == k allowed

int bruteforce(int n){
	int ans = -INF;
	
	for(int i = 0; i < n; i++) {
	    for(int j = 0; j < n; j++) {
	        for(int k = 0; k < n; k++) {
	            int curr = abs(a[i] - a[j] - a[k]) + abs(i - j - k);
	            ans = max(ans, curr);
	        }
	    }
	}
	return ans;
}

int consistency(int n){
	
	int max1 = -INF; // ai + i
	int min1 = INF;  // ai + i
	
	int max2 = -INF; // i - ai
	int max3 = -INF; // aj - j 
	
	for(int i=0; i<n; i++){
		max1 = max(max1, a[i] + i);
		min1 = min(min1, a[i] + i);
		
		max2 = max(max2, i - a[i]);
		max3 = max(max3, a[i] - i);
	}
	
	int ans = max1 - 2*min1;
	ans = max(ans, 2*max1 - min1);
	ans = max(ans, max2 + 2*max3);
	ans = max(ans, max3 + 2*max2);
	
	return ans;
}









int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << bruteforce(n) << " " << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}