Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. The same permutation

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSeyyed and MoJaK are friends of Sajjad. Sajjad likes a permutation. Seyyed wants to change the permutation in a way that Sajjad won't like it. Seyyed thinks more swaps yield more probability to do that, so he makes MoJaK to perform a swap between every pair of positions (*i*, *j*), where *i* < *j*, exactly once. MoJaK doesn't like to upset Sajjad.

Given the permutation, determine whether it is possible to swap all pairs of positions so that the permutation stays the same. If it is possible find how to do that.

Input

The first line contains single integer *n* (1 ≤ *n* ≤ 1000) — the size of the permutation.

As the permutation is not important, you can consider *a*_{i} = *i*, where the permutation is *a*_{1}, *a*_{2}, ..., *a*_{n}.

Output

If it is not possible to swap all pairs of positions so that the permutation stays the same, print "NO",

Otherwise print "YES", then print lines: the *i*-th of these lines should contain two integers *a* and *b* (*a* < *b*) — the positions where the *i*-th swap is performed.

Examples

Input

3

Output

NO

Input

1

Output

YES

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/21/2017 02:02:16 (c6).

Desktop version, switch to mobile version.

User lists

Name |
---|