// https://www.hackerrank.com/challenges/java-lambda-expressions/problem
import java.io.*;
import java.util.*;
interface PerformOperation {
 boolean check(int a);
}
class MyMath {
 public static boolean checker(PerformOperation p, int num) {
  return p.check(num);
 }

    public PerformOperation isOdd() {
        return (value) -> { return value % 2 == 1; };
    }

    public PerformOperation isPrime() {
        return (value) -> {
            if (value % 2 == 0 && value != 2) return false;
            for (int i = 3; i < value / 2; i++) {
                if (value % i == 0)
                    return false;
            }
            return true; 
        };
    }

    public PerformOperation isPalindrome() {
        return (value) -> { 
            char[] s = String.valueOf(value).toCharArray();
            int i = 0;
            while (i < s.length - i - 1) {
                if (s[i] != s[s.length - i - 1])
                    return false;
                i++;
            }
            return true;
        };
    }
}

public class Solution {

 public static void main(String[] args) throws IOException {
  MyMath ob = new MyMath();
  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  int T = Integer.parseInt(br.readLine());
  PerformOperation op;
  boolean ret = false;
  String ans = null;
  while (T--> 0) {
   String s = br.readLine().trim();
   StringTokenizer st = new StringTokenizer(s);
   int ch = Integer.parseInt(st.nextToken());
   int num = Integer.parseInt(st.nextToken());
   if (ch == 1) {
    op = ob.isOdd();
    ret = ob.checker(op, num);
    ans = (ret) ? "ODD" : "EVEN";
   } else if (ch == 2) {
    op = ob.isPrime();
    ret = ob.checker(op, num);
    ans = (ret) ? "PRIME" : "COMPOSITE";
   } else if (ch == 3) {
    op = ob.isPalindrome();
    ret = ob.checker(op, num);
    ans = (ret) ? "PALINDROME" : "NOT PALINDROME";

   }
   System.out.println(ans);
  }
 }
}