#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
#define int long long
int n, k;
int ans[100000];
int m[5];
signed main()
{
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> m[0];
		cin >> m[1];
		cin >> m[2];
		cin >> m[3];
		cin >> m[4];
		sort(m, m + 5);
		k = m[1]-m[0];
        m[1]-=k;
        m[2]-=k;
        m[3]-=k;
        m[4]-=k;
		while (m[0]!=0)
		{
			m[1]--;
			m[2]--;
			m[3]--;
            m[4]--;
			k++;
			sort(m, m + 5);
		}
		ans[i] = k + m[1];
	}
	for (int p = 0; p < n; p++)
	{
		cout << ans[p] << endl;
	}
	return 0;
}