JavaScriptEasyNumbers10 min

Check whether a number is prime

Return whether n is prime; integers below 2 are not prime. All input is valid JSON satisfying the constraints; do not mutate the meaning of values through type coercion. Interviewers use this problem to assess test divisors only up to the square root.

Input

A JSON integer n.

Output

Print one compact JSON value: a boolean.

Constraints

0 <= n <= 1000000000.

Example

Input

Output

true

Example 2 input

Output

true

Boundary case: Two is prime

Public test cases (2)

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

Hints (2)

A composite number has a factor at most its square root
Two is prime

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

Your solution

const input = JSON.parse(require("fs").readFileSync(0, "utf8"));
function solve(input) {
  // your code
  return false;
}
console.log(JSON.stringify(solve(input)));

Standard input

Checking runner availability…

Reference solution

Check a palindrome string · Easy
Check whether two strings are anagrams · Easy
Compute a factorial · Easy
Find a value with binary search · Easy
Find the first non-repeated character · Easy
Find the second-largest distinct value · Easy
Generate Fibonacci numbers · Easy
Keep unique array values in order · Easy
Move zeroes to the end · Easy
Reverse a string · Easy

All JavaScript programs

Check whether a number is prime

Input

Output

Constraints

Example

Public test cases (2)

Your solution

Reference solution

More JavaScript programs