#include <bits/stdc++.h>
using namespace std;
struct node {
  int p;
  int a;
} s[25];
int factor[10000005];
int t = 0;
int main() {
  int pn = 0;
  int n;
  int total = 0;
  scanf("%d", &n);
  int temp = n;
  for (int i = 2; i * i <= temp; i++) {
    if (n % i == 0) {
      pn++;
      s[pn].p = i;
    }
    while (n % i == 0) {
      s[pn].a++;
      n = n / i;
    }
    if (temp % i == 0) {
      total += i + temp / i;
      if (i * i == temp) {
        total -= i;
        t++;
        factor[t] = i;
      } else {
        t++;
        factor[t] = i;
        t++;
        factor[t] = temp / i;
      }
    }
  }
  if (n != 1) {
    pn++;
    s[pn].p = n;
    s[pn].a = 1;
  }
  total = 0;
  if (total > temp - 1) {
    printf("NO");
  } else if (total == temp - 1) {
    printf("YES\n");
    printf("%d\n", t);
    for (int i = 1; i <= t; i++) printf("1 %d\n", factor[i]);
  } else {
    int need = temp - 1 - total;
    if (pn <= 1) {
      printf("NO");
    } else {
      if (s[1].p + s[2].p > need) {
        if (need % s[1].p == 0) {
          printf("YES\n");
          printf("1\n");
          for (int i = 1; i <= t; i++) {
            if (i == 1) printf("%d %d", need / s[1].p, temp / factor[i]);
          }
        } else if (need % s[2].p == 0) {
          printf("YES\n");
          printf("1\n");
          for (int i = 1; i <= t; i++) {
            if (factor[i] == s[2].p)
              printf("%d %d", need / s[2].p, temp / factor[i]);
          }
        } else {
          for (int i = 1; i <= pn; i++) {
            if (need % s[i].p == 0) {
              printf("YES\n");
              printf("1\n");
              for (int i = 1; i <= t; i++) {
                if (factor[i] == s[i].p)
                  printf("%d %d", need / s[i].p, temp / factor[i]);
              }
              break;
            }
            if (i == pn) printf("NO");
          }
        }
      } else {
        int x, y;
        x = y = 0;
        int a, b;
        a = s[1].p;
        b = s[2].p;
        for (int i = 0; a * i <= need; i++) {
          if ((need - a * i) % b == 0) {
            x += i;
            y += (need - a * i) / b;
            break;
          }
        }
        printf("YES\n");
        printf("2\n");
        for (int i = 1; i <= t; i++) {
          if (factor[i] == a)
            printf("%d %d\n", x, temp / factor[i]);
          else if (factor[i] == b)
            printf("%d %d", y, temp / factor[i]);
        }
      }
    }
  }
  return 0;
}
