Cafeteria Service Decision

In this problem, you are given a single integer representing a dish number. The cafeteria will serve the dish only if its number is a prime number. A prime number is defined as a natural number greater than 1 that has no divisors other than 1 and itself. One common approach to determine whether a number \( n \) is prime is to check divisibility for all numbers from 2 up to \( \sqrt{n} \).

Your task is to implement a program that reads the dish number from stdin and prints "Serve" if the dish number is prime, or "Do not serve" otherwise. Ensure that your solution reads input from standard input and writes output to standard output.

inputFormat

The input consists of a single line containing an integer \( n \), representing the dish number.

outputFormat

Output a single line that is either "Serve" if the dish number is a prime number, or "Do not serve" if it is not.

7

Serve