Strictly Palindromic Number

In this problem, you are given an integer (n) where (3 \leq n \leq 1000). A number is said to be strictly palindromic if its representation in every base (b) (with (2 \leq b \leq n-2)) is a palindrome. However, it has been mathematically proven that for any integer (n \geq 4) no such strictly palindromic number exists. Therefore, for all valid inputs in this problem, the answer is always NO.

Your task is to implement a program that reads an integer from standard input and prints NO to standard output.

inputFormat

The input consists of a single integer (n) where (3 \leq n \leq 1000). This integer is provided through standard input.

outputFormat

Output a single line containing the string NO (without quotes) to standard output.## sample

5

NO