#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int N = 2e5 + 4;
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
  }
  return res;
}
long long gcd(long long a, long long b) {
  while (b > 0) {
    long long t = a % b;
    a = b, b = t;
  }
  return a;
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
long long is_prime(long long n) {
  if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0)) return 0;
  for (long long i = 5, t = 2; i * i <= n; i += t, t = 6 - t)
    if (n % i == 0) return 0;
  return 1;
}
long long modI(long long a, long long m) {
  long long m0 = m, y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m;
    a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long mod_inv(long long a, long long m = MOD) {
  return a == 1 ? 1 : m - mod_inv(m % a, a) * m / a;
}
long long choose(long long n, long long r) {
  long long product = 1;
  for (long long i = 0; i < r; i++)
    product = product * (n - i) % MOD * mod_inv(i + 1) % MOD;
  return product;
}
int bit[N];
void update(int idx, int val) {
  while (idx <= N) {
    bit[idx] += val;
    idx += idx & -idx;
  }
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int n = s.length();
    if (s[n - 1] == 'o' && s[n - 2] == 'p')
      cout << "FILIPINO"
           << "\n";
    else if ((s[n - 1] == 'u' && s[n - 2] == 's' && s[n - 3] == 'e' &&
              s[n - 4] == 'd') ||
             (s[n - 1] == 'u' && s[n - 2] == 's' && s[n - 3] == 'a' &&
              s[n - 4] == 'm'))
      cout << "JAPANESE"
           << "\n";
    else
      cout << "KOREAN"
           << "\n";
  }
  return 0;
}
