Unique Password Generation

Given an integer n that represents the desired length of a password, determine whether it is possible to generate a unique password that meets all of the following conditions:

• The password must contain at least one digit, one lowercase Latin letter, and one special character (for example: !, @, #, etc.).
• No two consecutive characters can be the same.

Since the minimum set of characters required is 3, it is only possible to generate such a password if n is at least 3. Otherwise, it is impossible.

inputFormat

The input consists of a single integer n (1 ≤ n ≤ 10⁵), representing the desired length of the password.

outputFormat

Output a single line containing YES if it is possible to generate a password that meets the constraints. Otherwise, output NO.

1

NO