跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1801. Watermelon

  • ID: 1807
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 1
  • AC · 已通过: 1
  • 教学难度:入门
  • 上传者:
  • 枚举
  • 数学
  • 算法思想
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Watermelon

题目描述

A. Watermelon
time limit per test
1 second
memory limit per test
64 megabytes
input
standard input
output
standard output

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1359 题。保留原作者与原赛事署名。