#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int n;
struct Graph {
    int n;
    vector<pii> g;
    void Debug() {
        cout << n << endl;
        for (auto [x, y] : g) cout << x << ' ' << y << endl;
    }
};
void MergeTo(Graph &a, const Graph &b) {
    for (const auto [x, y] : b.g) {
        a.g.push_back({x + a.n, y + a.n});
    }
    a.n += b.n;
}
vector<Graph> f[100];
typedef vector<Graph>::iterator vgit;
inline void Dfs(int si, vgit it, Graph cur, int target_size, int size_limit, vector<Graph> &rst) {
    if (cur.n == target_size) { rst.push_back(cur); return; }
    if (it == f[si].end()) it = f[++si].begin();
    if (cur.n + si > target_size || si > size_limit) return;
    Dfs(si, next(it), cur, target_size, size_limit, rst);
    cur.g.push_back({1, cur.n + 1});
    MergeTo(cur, *it);
    Dfs(si, next(it), cur, target_size, size_limit, rst);
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    if (n == 1) { cout << "YES\n0\n"; return 0; }
    if (n <= 5) { cout << "NO\n"; return 0; }
    if (n <= 7) { 
        cout << "YES\n6\n1 2\n2 3\n1 3\n3 4\n2 5\n5 6\n";
        return 0;
    }
    f[1].push_back({1, {}});
    Graph ans({0, {}});
    MergeTo(ans, f[1][0]);
    const int LIM = 16;
    for (int i = 2; i <= LIM; ++i) {
        Dfs(1, f[1].begin(), {1, {}}, i, 1e9, f[i]);
        // for (auto x : f[i]) x.Debug();
    }
    for (int i = 7; i <= 2 * LIM; ++i) {
        vector<Graph> rst;
        if (i % 2 == 0) {
            for (vgit p1 = f[i / 2].begin(); p1 != f[i / 2].end(); ++p1) 
                for (vgit p2 = next(p1); p2 != f[i / 2].end(); ++p2) {
                    Graph cur(*p1);
                    cur.g.push_back({1, cur.n + 1});
                    MergeTo(cur, *p2);
                    rst.push_back(cur);
                }
        }
        Dfs(1, f[1].begin(), {1, {}}, i, (i - 1) / 2, rst);
        // cout << rst.size() << endl;
        while (!rst.empty()) {
            int nxt = (rst.size() >= 2 ? i : i + 1);
            if (ans.n + i + nxt > n) break;
            MergeTo(ans, rst.back());
            rst.pop_back();
        }
        if (!rst.empty()) break;
    }
    Graph last;
    last.n = n - ans.n;
    // cout << last.n << endl;
    // return 0;
    last.g.push_back({1, 2});
    last.g.push_back({1, 3});
    last.g.push_back({3, 4});
    last.g.push_back({1, 5});
    for (int i = 6; i <= last.n; ++i) last.g.push_back({i - 1, i});
    MergeTo(ans, last);
    cout << "YES\n";
    cout << ans.g.size() << '\n';
    for (auto [x, y] : ans.g) cout << x << ' ' << y << '\n'; 
    return 0;
}