Submit solution

Points:
15

Time limit:
1.0s

Memory limit:
64M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C++, COBOL, ~~CommonLisp~~, Dart, Forth, Fortran, Intercal, Lisp, ~~Octave~~, Pascal, Prolog, Python, Racket, Rust, Scheme, Sed, TCL, Text, Turing, VB

##### Brute Force Practice 3 — Hard Version

You love prime numbers. You own a number, but you suspect it might not be prime. You want a prime number, but it must be at least as large as the number you currently own. Find the smallest number that satisfies those conditions.

#### Input Specification

The first line will have the integer ().

#### Output Specification

Print the number you want.

#### Sample Input

`4`

#### Sample Output

`5`

## Comments

Partial output is disabled for this problem.