#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
const int mod2 = 998244353;
long long exp(long long taban, long long us, long long md) {
  long long carpan = taban % md;
  long long temp = us;
  long long res = 1;
  while (temp) {
    if (temp % 2) res = (res * carpan) % md;
    temp /= 2;
    carpan = (carpan * carpan) % md;
  }
  return res;
}
long long ebob(long long a, long long b) {
  if (!a) return b;
  return ebob(b % a, a);
}
long long ekok(long long a, long long b) { return (a * b) / ebob(a, b); }
long long mul(long long a, long long b, long long md) { return a * b % md; }
const int N = 1e5 + 5;
vector<long long> fact;
vector<long long> inv_fact;
void fact_init(int n) {
  fact.resize(n + 5);
  inv_fact.resize(n + 5);
  fact[0] = inv_fact[0] = 1;
  for (int i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    inv_fact[i] = exp(fact[i], mod - 2, mod);
  }
}
long long komb(long long a, long long b) {
  return fact[a] * (inv_fact[a - b] * inv_fact[b] % mod) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      int diger = n / i;
      if (ebob(diger, i) == 1) {
        cout << "YES\n2\n";
        for (int j = 1; j < i; j++) {
          if ((n - 1 - diger * j) % i == 0) {
            cout << j << " " << i << "\n"
                 << (n - 1 - diger * j) / i << " " << diger << endl;
            return 0;
          }
        }
      }
    }
  }
  cout << "NO";
}
