#include <bits/stdc++.h>
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
const int inf = 1e9;
const double eps = 1e-9;
const int mod = 1e9 + 7;
const int maxn = 1e9 + 7;
const double pi = 3.1415926535897932384626433832795;
using namespace std;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.precision(15);
  cout << fixed;
  int n;
  cin >> n;
  vector<int> p;
  int x = n;
  for (long long i = 2; i * i <= x; ++i) {
    if (!(x % i)) {
      p.push_back(i);
      while (!(x % i)) x /= i;
    }
  }
  if (x > 1) p.push_back(x);
  if (p.size() < 2) {
    cout << "NO\n";
    return 0;
  }
  sort(p.begin(), p.end());
  int b1 = p[p.size() - 2];
  int b2 = p[p.size() - 1];
  int a1 = 0, a2 = 0;
  for (int i = 1; i <= (n - 1 - b2) / b1; ++i) {
    if (!((n - 1 - b1 * i) % b2)) {
      a1 = i;
      a2 = (n - 1 - b1 * i) / b2;
      break;
    }
  }
  cout << "YES\n" << 2 << "\n";
  cout << a1 << " " << n / b1 << "\n";
  cout << a2 << " " << n / b2 << "\n";
  return 0;
}
