#include <bits/stdc++.h>
using namespace std;
template <class T>
T eea(T a, T b, T& x, T& y) {
  if (!b) {
    x = 1;
    y = 0;
    return a;
  }
  T x1, y1;
  T g = eea(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return g;
}
const int SITO_MAX = 100000;
int f[SITO_MAX + 1];
vector<int> prosti;
struct sito {
  sito() {
    for (int i = 2; i <= SITO_MAX; i++) {
      if (f[i] == 0) {
        f[i] = i;
        prosti.push_back(i);
      }
      int j = 0;
      while (j < (int)prosti.size()) {
        if (prosti[j] > f[i]) {
          break;
        }
        int x = i * prosti[j];
        if (x > SITO_MAX) {
          break;
        }
        f[x] = prosti[j];
        j++;
      }
    }
  }
} sito_obj_983431;
vector<pair<int, int>> factor_small(int x) {
  vector<pair<int, int>> v;
  while (x > 1) {
    int p = f[x];
    int c = 0;
    while (x % p == 0) {
      x /= p;
      c++;
    }
    v.push_back({p, c});
  }
  return v;
}
vector<pair<int, int>> factor(int x) {
  vector<pair<int, int>> v;
  for (int p : prosti) {
    if (x % p == 0) {
      int c = 0;
      while (x % p == 0) {
        x /= p;
        c++;
      }
      v.push_back({p, c});
    }
  }
  if (x > 1) {
    v.push_back({x, 1});
  }
  return v;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cerr.tie(nullptr);
  long long n;
  cin >> n;
  auto v = factor(n);
  if (v.size() == 1) {
    cout << "NO\n";
    return 0;
  }
  long long p = 1;
  for (int i = 0; i < v[0].second; i++) p *= v[0].first;
  long long q = n / p;
  long long x, y;
  eea(p, q, x, y);
  x *= -1;
  y *= -1;
  if (x < 0) {
    x += q;
  } else {
    y += p;
  }
  if (x >= q || y >= p || x < 1 || y < 1) cerr << "ne valja!\n";
  cout << "YES\n2\n";
  cout << x << ' ' << q << '\n';
  cout << y << ' ' << p << '\n';
}
