//Prime or Composite Simplified By Regie Buo

import javax.swing.JOptionPane;
//import java.util.Scanner;
public class PrimeOrComposite {
    public static void main(String[] args) {
        //Scanner input = new Scanner(System.in);

        int num = Integer.parseInt(JOptionPane.showInputDialog("Enter a number")); 
        //int num = input.nextInt();

        //int num = 5;
        String remarks = "";
        if ((num == 0) || (num == 1)) { //Kung zero ug 1 is always prime or nether
            remarks = "Prime";
        }
        int count = 0;
        for (int i = 1; num>i; i++) {
            if (num%i == 0) {
                count ++; //Kung pag divide sa i kay walay remainder i plus niyag 1 ang count
            } 
            if (count >= 2) { //kuig ang count mo abot nag duha ka count 2 mo remarks na siyag Composite
                remarks = "Composite";
                break; //para mo gawas deretso. Pero no need nani Gi klaro ra nako
            } else {
                remarks = "Prime"; //Kung taman ra 1 ang count or wala jud 
            }
        }
        System.out.println(num+" is "+remarks);
    }
}