UVA 1594

#include<iostream>
#include<vector>
#include<string>
#include<type_traits>
#include<sstream>
#include<tuple>
#include<bitset>
#include<regex>
#include<set>
#include<queue>
using namespace std;

int main(){
	int T, n;
	cin >> T;
	while (T--){
		cin >> n;
		vector<int> arr(n,0);
		set<vector<int>> data;
		for (int i = 0; i < n; i++) cin >> arr[i];
		if (data.find(arr) != data.end()){
			cout << "ZERO" << endl;
			continue;
		}
		while (true){
			int temp = arr[0];
			for (int i = 0; i < n; i++){
				int index2 = (i + 1) % n;
				int index1 = i;
				if (index2 != 0){
					arr[i] = abs(arr[index1] - arr[index2]);
				}
				else{
					arr[i] = abs(arr[index1] - temp);
				}
			}
			if (data.find(arr) != data.end()){
				bool flag = true;
				for (int i = 0; i < arr.size(); i++){
					if (arr[i] != 0){
						flag = false;
						break;
					}
				}
				if (flag) cout << "ZERO" << endl;
				else cout << "LOOP" << endl;
				break;
			}
			else data.insert(arr);
		}
	}
	//system("pause");
	return 0;
}