Watermelon CodeForces - 4A

Text Reverse
Time limit 1000 ms
Memory limit65536 kB
Source Codeforces Beta Round #4 (Div. 2 Only)
Tags brute force math *1200
Editorial Announcement Tutorial #1 Tutorial #2 Tutorial #3

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
8
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).

问题链接：
CodeForces - 4A

问题简述：
两个偶数狂热者买偶数重量的西瓜并希望能够将它分成偶数重量的两半且重量不为空。

问题分析：
判断输入的数值是否是偶数，只要是大于2的偶数，都能被分为2与另一个偶数的组合，所以需要注意输入数值为2的情况。

程序说明：
判断输入的数值是否是偶数，是否输入为2。

 #include <iostream>
using namespace std;


int main()
{
	int w;
	cin >> w;
	if (w % 2 == 0 && w!= 2)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
	return 0;
}