#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t N = 1e6 + 5;
int64_t bpow(int64_t x, int64_t y) {
  if (y == 0) return 1;
  int64_t temp = bpow(x, y / 2);
  temp *= temp;
  if (y & 1) temp *= x;
  return temp;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int64_t n;
  cin >> n;
  int64_t np = 0;
  vector<pair<int64_t, int64_t>> primes;
  int64_t k = n;
  for (int64_t i = 2; i * i <= k; i++) {
    if (k % i == 0) {
      int64_t cnt = 0;
      while (k % i == 0) {
        k /= i;
        cnt++;
      }
      primes.push_back({i, cnt});
    }
  }
  if (k > 1) {
    primes.push_back({k, 1});
  }
  if (primes.size() <= 1) {
    cout << "NO\n";
    return 0;
  }
  int64_t n1 = 1, n2 = 1;
  k = 1;
  for (int64_t i = 0; i < k; i++) n1 *= bpow(primes[i].first, primes[i].second);
  for (int64_t i = k; i < primes.size(); i++)
    n2 *= bpow(primes[i].first, primes[i].second);
  for (int64_t i = 1; i < n1; i++) {
    if ((n - 1 - n2 * i) % n1 == 0) {
      cout << "YES\n2\n";
      cout << i << " " << n1 << "\n";
      cout << (n - 1 - n2 * i) / n1 << " " << n2 << "\n";
      return 0;
    }
  }
  return 0;
}
