#include <bits/stdc++.h>
using namespace std;
void egcd(long long p, long long q, long long &a, long long &b) {
  if (p < q) {
    egcd(q, p, a, b);
    swap(a, b);
  } else if (q == 0) {
    a = 1;
    b = 0;
  } else {
    egcd(q, p % q, a, b);
    long long t = a - (p / q) * b;
    a = b;
    b = t;
  }
}
vector<pair<long long, long long>> res;
void print_fraction(long long x, long long y) {
  while (x >= y) {
    res.push_back(make_pair(y - 1, y));
    x -= y - 1;
  }
  res.push_back(make_pair(x, y));
}
void solve(int n) {
  int n0 = n;
  vector<int> divs;
  for (int i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      divs.push_back(i);
      n /= i;
    }
  }
  if (n > 1) divs.push_back(n);
  sort(divs.begin(), divs.end());
  reverse(divs.begin(), divs.end());
  n = n0;
  if (divs[0] == divs[divs.size() - 1]) {
    cout << "NO" << endl;
    return;
  }
  long long p = 1, q = 1;
  for (int i = 0; divs[i] == divs[0]; i++) p *= divs[i];
  q = (long long)n / p;
  long long a, b;
  egcd(p, q, a, b);
  if (a * p + b * q != 1) {
    cout << "ERR " << a << "*" << p << " + " << b << "*" << q << endl;
  }
  if (a < 0) {
    swap(p, q);
    swap(a, b);
  }
  res.clear();
  print_fraction(-b, p);
  print_fraction(q - a, q);
  cout << "YES" << endl << res.size() << endl;
  for (auto x : res) cout << x.first << " " << x.second << endl;
}
int main() {
  long long n;
  cin >> n;
  solve(n);
  return 0;
}
