#include <bits/stdc++.h>
using namespace std;
long long int m;
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    res %= m;
    y = y >> 1;
    x = x * x;
    x %= m;
  }
  return res;
}
long long int inv(long long int x) { return power(x, m - 2); }
long long int prime[100009];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> m;
  for (long long int i = 2; i <= 100000; i++) {
    if (prime[i] == 0) {
      for (long long int j = (2 * i); j <= 100000; j += i) {
        prime[j] = 1;
      }
    }
  }
  if (m == 1) {
    cout << "YES" << '\n' << 1;
  } else if (m == 4) {
    cout << "YES" << '\n';
    cout << 1 << '\n' << 3 << '\n' << 2 << '\n' << 4;
  } else if (prime[m] == 0) {
    cout << "YES" << '\n';
    cout << 1 << '\n';
    long long int x = 1;
    for (long long int j = 2; j < m; j++) {
      x = inv((j - 1));
      x *= j;
      x %= m;
      cout << x << '\n';
    }
    cout << m;
  } else {
    cout << "NO";
  }
}
