#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

tem T>
string _ARR_(T* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9+7;

bool solve(vector<int> &v){
	int n = v.size();
	bool ok = 0;
	int mnl = n+1, mxr=-1;

	for(int i = 0; i < n; ++i){
		if(i == n/2 && v[i]) ok = 1;
		if(i%2==0 && v[i/2]) mxr = i;
		if(i%2==0 && v[(n-1+i)/2]) mnl = min(mnl, i);
	}

	ok |= (mxr-mnl >= 0);
	return ok;
}

int main(void)
{
	FAST;
	TC{
		string s; cin >> s;
		int n = s.size();
		vector<int> v, dp;

		int len = 1;
		for(int i = 1; i < n; ++i){
			if(s[i] != s[i-1]){
				v.pb((len>1));
				len = 1;
			}else ++len;
		}
		v.pb((len>1));
		n = v.size();
		bool ok = 0;

		if(n%2==0){
			for(int i = 0; i < n; ++i){
				if(i%2==0 && v[i/2] && v[(n-1+i+1)/2]) ok = 1;
			}

			if(v.back() == 1){
				v.pop_back();
				ok |= solve(v);
				v.pb(1);
			}

			if(v[0] == 1){
				vector<int> nv;
				for(int i = 1; i < n; ++i) nv.pb(v[i]);
				ok |= solve(nv);
			}

			int mxl = 0, mnr = n;
			for(int i = 0; i < n; ++i){
				if(i%2==0 && v[i/2]) mnr = min(mnr, i);
				if(i%2==1 && v[(n-1+i)/2]) mxl = max(mxl, i);
			}

			if(mxl > mnr){
				int lside = mnr/2, rside = (n-1+mxl)/2;
				int dist = mxl-mnr-1;
				for(int i = lside+1; i < rside; ++i){
					//left side : mnr
					//right side mxl

					if(!v[i]) continue;

					int l, r, dl = (i-lside), dr=(rside-i);	

					if(dl > dr) swap(dl, dr);
					//dl <= dr
					if(2*dl >= dist) ok = 1;
				}
			}


		}else ok = solve(v);

		cout << (ok ? "IGEN\n" : "NEM\n");
	}

	return 0;
}