#include <bits/stdc++.h>
using namespace std;
int ap[100];
void factorization(int n, vector<int> &p) {
  for (int i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      ap[p.size()] = 0;
      while (n % i == 0) {
        ++ap[p.size()];
        n /= i;
      }
      p.push_back(i);
    }
  }
  if (n > 1) p.push_back(n);
}
int _gcd(int a, int b) {
  while (a > 0 && b > 0) {
    if (a > b)
      a %= b;
    else
      b %= a;
  }
  return a + b;
}
int pow(int x, int st) {
  if (st == 0 || x == 1)
    return 1;
  else if (st == 1)
    return x;
  else if (st % 2 == 0)
    return pow(x, st / 2) * pow(x, st / 2);
  else
    return pow(x, st - 1) * x;
}
int main() {
  int n;
  cin >> n;
  vector<int> p;
  factorization(n, p);
  int a, b, x, y;
  a = b = x = y = -1;
  bool f = false;
  for (int i = 0; i < p.size() && !f; ++i) {
    if (_gcd(pow(p[i], ap[i]), n / pow(p[i], ap[i])) == 1) {
      a = pow(p[i], ap[i]);
      b = n / pow(p[i], ap[i]);
      for (x = 1; x < b && !f; ++x) {
        if ((n - 1 - b * x) % a == 0) {
          y = (n - 1 - b * x) / a;
          f = true;
        }
      }
    }
  }
  if (f && x > 0 && y > 0) {
    cout << "YES" << endl;
    cout << "2" << endl;
    cout << (x - 1) << " " << a << endl;
    cout << y << " " << b;
  } else
    cout << "NO";
  return 0;
}
