Prime Check

Lab Java Beginner 10 points

Read n ≥ 2 and print prime or composite, testing divisors only up to √n.

Input

One integer.

Output

One word.

Example

Input

Output

prime

Sample input available Sample output available

Editor

Java

Hints

d * d <= n avoids computing a square root.

Solution explanation

If n has a factor larger than √n, it also has one smaller than √n.

Show solution

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        boolean prime = true;
        for (long d = 2; d * d <= n; d++) {
            if (n % d == 0) {
                prime = false;
                break;
            }
        }
        System.out.println(prime ? "prime" : "composite");
    }
}

Output

Answer