#include<bits/stdc++.h>
using namespace std;
int t;
int n;
const int maxn = 1e6 + 10;
int a[maxn];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin >> t;
	while(t--)
	{
		cin >> n;
		for(int i = 1;i <= n;i++)
		{
			cin >> a[i];
			a[i] += a[i - 1];
		}
		if(a[n] != 0)
		{
			cout << "laycentral\n";
			continue;
		}
		int cnt = 1;
		int ans = 1;
		sort(a + 1,a + n + 1);
		for(int i = 2;i <= n;i++)
		{
			a[i] == a[i - 1] ? cnt++ : cnt = 1;
			ans = max(ans,cnt);
		}
		cout << n - ans << "\n";
	}
	return 0;
}