#include <bits/stdc++.h>
using namespace std;
long long int expMod(long long base, long long exp, long long m) {
  if (exp == 0)
    return 1;
  else if (exp == 1)
    return base;
  long long ret = expMod(base, exp / 2, m);
  ret = (ret * ret) % m;
  if (exp % 2) ret = (ret * base) % m;
  return ret;
}
long long inv(long long a, long long m) { return expMod(a, m - 2, m); }
int main() {
  long long int N;
  cin >> N;
  if (N == 1) {
    cout << "YES" << endl;
    cout << 1 << endl;
    return 0;
  } else if (N == 4) {
    cout << "YES" << endl;
    cout << "1" << endl << 3 << endl << 2 << endl << 4 << endl;
    return 0;
  } else {
    for (int i = 2; i < N; i++)
      if (N % i == 0) {
        cout << "NO" << endl;
        return 0;
      }
    cout << "YES" << endl;
    cout << 1 << endl;
    for (long long int i = 2; i < N; i++)
      cout << (((i) * (inv(i - 1, N)) % N)) << endl;
    cout << N << endl;
  }
  return 0;
}
