JavaEasyNumbers10 min

Check whether an integer is prime

Print true if n is prime, otherwise false. Follow the stated ordering and edge-case conventions exactly. Interviewers use this task to probe algorithm selection, invariants, and boundary handling.

Input

One integer n.

Output

Print true if n is prime, otherwise false.

Constraints

-1000000000 <= n <= 1000000000.

Example

Input

Output

true

Example 2 input

999999937

Output

true

This example exercises a large prime.

Public test cases (2)

Input
```
29
```
Expected output
```
true
```
Input
```
21
```
Expected output
```
false
```

Hints (2)

Identify the state needed to avoid recomputing work for each element.
A composite number has a divisor no larger than its square root.

Target complexity: time O(sqrt(n)) · space O(1)

Your solution

import java.util.*;
import java.math.BigInteger;

public class Main {
    
    static String prime_check(Scanner s) {
        while (s.hasNextLine()) s.nextLine();
        // your code
        return "";
    }
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println(prime_check(s));
    }
}

Standard input

Checking runner availability…

Reference solution

Anagram check · Easy
Check for an Armstrong number · Easy
Check whether a number is a palindrome · Easy
Compute a factorial with BigInteger · Easy
Count vowels and consonants · Easy
Find the first occurrence with binary search · Easy
Find the GCD and LCM · Easy
Find the minimum and maximum in an array · Easy
Generate the Fibonacci series · Easy
Palindrome check ignoring case and spaces · Easy

All Java programs

Check whether an integer is prime

Input

Output

Constraints

Example

Public test cases (2)

Your solution

Reference solution

More Java programs