codeforces.ml/problemset/problem/4/A Watermelon

传送门
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
inputCopy
8
outputCopy
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公斤。他们冲回家，渴得要死，决定把西瓜分了，但他们遇到了一个难题。
皮特和比利都是偶数的粉丝，这就是为什么他们要把西瓜分成两部分，每一部分重量都是偶数公斤，同时这两部分也不是必须相等的。孩子们非常累，想要尽快开始吃西瓜，你应该帮助他们，看看他们是否能按自己想要的方式分西瓜。当然，它们每个都应该有一部分正权值。
输入
第一个(也是唯一的)输入行包含整数w(1≤w≤100)——男孩们买的西瓜的重量。
输出
是的，如果孩子们能把西瓜分成两部分，每个部分的重量都是偶数公斤;反之则不然。

#include<stdio.h>
int main(){
	int n;
	scanf("%d",&n);
	if(n==2){
		printf("NO");
	}
	else if((n-2)%2==0){
		printf("YES");
	}
	else
	printf("NO");
	return 0;
}