#include <bits/stdc++.h>
using namespace std;
void in(int &x) {
  register int c = getchar();
  x = 0;
  for (; (c < 48 || c > 57); c = getchar())
    ;
  for (; c > 47 && c < 58; c = getchar()) {
    x = (x << 1) + (x << 3) + c - 48;
  }
}
long long mod;
bool prime(int n) {
  int i;
  if (n % 2 == 0 && n > 2) return false;
  for (i = 3; i * i <= n; i += 2)
    if (n % i == 0) return false;
  return true;
}
long long powmod(long long base, long long exp) {
  long long res = 1;
  while (exp) {
    if (exp & 1) res = (res * base) % mod;
    base = (base * base) % mod;
    exp >>= 1;
  }
  return res;
}
int main() {
  int n, i, x;
  in(n);
  if (n == 1) {
    puts("YES\n1");
    return 0;
  }
  if (n == 4) {
    puts("YES\n1\n3\n2\n4");
    return 0;
  }
  if (!prime(n)) {
    puts("NO");
    return 0;
  }
  mod = n;
  puts("YES\n1");
  for (i = 2; i < n; i++) printf("%lld\n", i * powmod(i - 1, n - 2) % n);
  printf("%d\n", n);
  return 0;
}
