#include <bits/stdc++.h>
using namespace std;
using cd = complex<double>;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = exgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
vector<long long> c;
int main() {
  long long n;
  cin >> n;
  long long sum = n - 1, num = 1;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        num *= i;
        n /= i;
      }
      break;
    }
  }
  if (num == 1 || n == 1) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  if (num > n) swap(n, num);
  for (long long i = 1; i < num; i++) {
    if ((sum - i * n) % num == 0) {
      cout << 2 << endl;
      cout << i << " " << num << endl;
      cout << (sum - i * n) / num << " " << n << endl;
      return 0;
    }
  }
}
