class OrderedStream {
public:
    string str[1010];
    int len,ptr;
    OrderedStream(int n) {
        ptr=1,len=n;
    }

    vector<string> insert(int idKey, string value) {
        str[idKey]=value;
        vector<string> res;
        while(str[ptr]!=""&&ptr<=len) 
            res.push_back(str[ptr++]);

        return res;
    }
};

/**
 * Your OrderedStream object will be instantiated and called as such:
 * OrderedStream* obj = new OrderedStream(n);
 * vector<string> param_1 = obj->insert(idKey,value);
 */

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        string str;
        cin>>str;
        int len=str.length();
        if(str[len-2]=='p'&&str[len-1]=='o') cout<<"FILIPINO"<<endl;
        else if(str.substr(len-4)=="desu"||str.substr(len-4)=="masu") cout<<"JAPANESE"<<endl;
        else cout<<"KOREAN"<<endl;
    }

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    cout<<a+b;
    return 0;
}

class Solution {
public:
    vector<vector<int>> groupThePeople(vector<int>& groupSizes) {
        vector<vector<int>> q[510];
        for(int i=0;i<groupSizes.size();i++)
        {
            int j=0;
            while(q[groupSizes[i]].size()!=0&&q[groupSizes[i]].size()>j&&groupSizes[i]==q[groupSizes[i]][j].size()) 
                j++;
            if(q[groupSizes[i]].size()==0||j==q[groupSizes[i]].size())
            {
                vector<int> tmp;
                tmp.push_back(i);
                q[groupSizes[i]].push_back(tmp);
            }
            else q[groupSizes[i]][j].push_back(i);
        }

        vector<vector<int>> res;
        for(int i=0;i<510;i++)
        {
            vector<vector<int>> tmp=q[i];
            if(tmp.size()==0) continue;
            for(int j=0;j<tmp.size();j++) res.push_back(tmp[j]);
        }

        return res;
    }
};

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

const int N=10010;
int n;
int b[N];
bool st[N];

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++) cin>>b[i];
    int k=0;
    for(int i=1;i<=n;i++)
    {
        if(!st[b[i]])
        {
            k++;
            for(int j=b[i];!st[j];j=b[j])
                st[j]=true;
        }
    }
    cout<<n-k<<endl;
    return 0;
}

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

const int N=110,M=1<<6,K=25,MOD=1e9+7;
int n,m,k;
int f[N][M][M][K];

int get_count(int x)
{
    int res=0;
    while(x)
    {
        res++;
        x-=x&-x;
    }
    return res;
}
int main()
{
    cin>>m>>n>>k;
    f[0][0][0][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int a=0;a<1<<m;a++)
        {
            for(int b=0;b<1<<m;b++)
            {
                if(a&(b<<2)||b&(a<<2)) continue;
                for(int c=0;c<1<<m;c++)
                {
                    if(c&(b<<2)||b&(c<<2)) continue;
                    if(c&(a<<1)||a&(c<<1)) continue;
                    int t=get_count(c);
                    for(int j=t;j<=k;j++)
                        f[i][b][c][j]=(f[i][b][c][j]+f[i-1][a][b][j-t])%MOD;
                }
            }
        }
    }
    int res=0;
    for(int a=0;a<1<<m;a++)
        for(int b=0;b<1<<m;b++)
            res=(res+f[n][a][b][k])%MOD;
    cout<<res<<endl;
    return 0;
}

#include<bits/stdc++.h>

#define x first
#define y second

using namespace std;

typedef pair<int,int> PII;
const int N=200010;

int n,m;
int s[N];
priority_queue<PII,vector<PII>,greater<PII>> q[N];

int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>s[i];
    while(m--)
    {
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        while(q[b].size()&&q[b].top().x<=a)
        {
            s[b]+=q[b].top().y;
            q[b].pop();
        }
        if(s[b]<d) cout<<"-1"<<endl;
        else
        {
            s[b]-=d;
            q[b].push({a+c,d});
            cout<<s[b]<<endl;
        }
    }

    return 0;
}

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

typedef long long LL;
LL n,x;
int main()
{
    cin>>n;
    LL res=1;
    for(LL i=2;i*i<=n;i++)
    {
        if(n%i==0)
        {
            int s=0;
            while(n%i==0) s++,n/=i;
            if(s%2) res*=i;
        }
    }
    if(n>1) res*=n;
    cout<<res<<endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int res=0;
    int n;
    cin>>n;
    for(int i=1;i<n;i++)
    {
        if(i*i%n<n/2.0) res++;
    }
    cout<<res;
    return 0;
}

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

bool check(int y)
{
    if(y/1000==y%100/10&&y%10==y%1000/100+1) return true;
    return false;
}
int main()
{
    int res=0;
    for(int i=0;i<5;i++)
    {
        int y;
        cin>>y;
        if(check(y)) res++;
    }
    cout<<res<<endl;
    return 0;
}