西瓜Codeforces-4A

最新推荐文章于 2022-10-11 23:25:57 发布

原创最新推荐文章于 2022-10-11 23:25:57 发布 · 486 阅读

0 ·

CC 4.0 BY-SA版权

本文探讨了一个有趣的编程问题：如何判断能否将一个特定重量的西瓜均匀分成两份，每份重量均为偶数。此问题不仅考验对偶数的理解，还涉及编程逻辑与条件判断。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem description

One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed w kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.

Pete and Billy are great fans of even numbers, that's why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that's why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.

Input

The first (and the only) input line contains integer number w (1 ≤ w ≤ 100) — the weight of the watermelon bought by the boys.

Output

Print YES, if the boys can divide the watermelon into two parts, each of them weighing even number of kilos; and NO in the opposite case.

Examples

Input

Output

YES

Note

For example, the boys can divide the watermelon into two parts of 2 and 6 kilos respectively (another variant — two parts of 4 and 4 kilos).

问题简述

将一个重w（1-100）千克的西瓜分成两部分，两部分的重量都要求是偶数。当西瓜的总重满足时，输出“YES”，反之，输出“NO”。