//#include <bits/stdc++.h>
//#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>


#define FOR(i, a, b) for( int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for( int i=(a);i>=(b);i--)
#define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++)
#define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000 //2000000000
#define LLINF 1000000000000000000 //9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000

using namespace std;
typedef long long int ll;
typedef pair< long long int, long long  int> P;
typedef string::const_iterator State;

int dy[5] = { 0,0,1,-1,0 };
int dx[5] = { 1,-1,0,0 ,0 };


int main(void) {

	int i;
	int n[6];

	cin >> i;
	FOR(j, 1, i) {
		cin >> n[j];
	}

	FOR(j, 1, i) {
		if (n[j] % 8 != 0 && n[j] % 10 != 0) {
			cout << n[j] / 3 << endl;
		}
		else if (n[j] % 8 == 0) {
			if (n[j] % 10 == 0) {
				cout << "ikisugi" << endl;
			}
			else {
				cout << "iki" << endl;
			}
		}
		else {
			if (n[j] % 10 == 0) {
				cout << "sugi" << endl;
			}
			else {
				cout << n[j] / 3 << endl;
			}
		}
	}

	return 0;
}