Pair Formation

You are given an integer (N) representing the number of team members. Your task is to determine whether it is possible to form pairs such that no one is left unpaired. In other words, pairing is possible if and only if (N \mod 2 = 0). If pairing is possible, output Yes; otherwise, output No.

Consider all edge cases, including small and very large values of (N). This problem tests your basic implementation skills and your understanding of modulus arithmetic.

inputFormat

The input is provided via standard input (stdin) and consists of a single integer (N) on one line, representing the number of team members.

outputFormat

Output a single line to standard output (stdout) containing the string Yes if (N) is even, or No if (N) is odd.## sample

2

Yes