#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e6 + 5;
int prime[MAX_N + 1];
void getPrime() {
  memset(prime, 0, sizeof prime);
  for (int i = 2; i <= MAX_N; i++) {
    if (!prime[i]) prime[++prime[0]] = i;
    for (int j = 1; j <= prime[0] && prime[j] <= MAX_N / i; j++) {
      prime[prime[j] * i] = 1;
      if (i % prime[j] == 0) break;
    }
  }
}
vector<int> p;
int main() {
  int n;
  getPrime();
  while (cin >> n) {
    p.clear();
    int tmp = n;
    for (int i = 1; i <= prime[0] && prime[i] <= tmp; i++) {
      if (tmp % prime[i] == 0) {
        p.push_back(prime[i]);
        while (tmp % prime[i] == 0) tmp /= prime[i];
      }
    }
    if (tmp > 1) p.push_back(tmp);
    if (p.size() == 1) {
      puts("NO");
    } else {
      int b1 = n / p[1], b2 = n / p[0];
      int a1 = 0, a2, res = n - 1;
      while (res >= p[1] && res % p[0]) {
        res -= p[1];
        a1++;
      }
      if (res % p[0]) {
        puts("NO");
      } else {
        a2 = res / p[0];
        puts("YES");
        puts("2");
        printf("%d %d\n", a1, b1);
        printf("%d %d\n", a2, b2);
      }
    }
  }
  return 0;
}
