Watermelon

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
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).
问题链接
https://cn.vjudge.net/problem/CodeForces-4A
问题简述
判断一个整数西瓜能否分为两份偶数块的西瓜
程序说明
用循环累加偶数来判断是否存在一种情况把其分为两个偶数

#include<iostream>
using namespace std;
int main()
{
	int n,i,a,b,k=0;
	cin >>n ;//输入西瓜重量
	if (4<=n&&n<=100)//如果在这个范围内，则有可能分为两个偶数
	{
		for (i = 1; 2 * i < n; i++)//判断第一块所有可能的偶数
		{   a = n-2*i;//判断第二块的是不是偶数
			if(a%2==0)
			k++;//用k来判断可能的情况
		
		}
		if (k == 0)cout << "NO";//判断有无可能
		else cout << "YES";
	}
	else cout << "NO";//不在那个范围内绝对不可能分为两个偶数块
}