#include <bits/stdc++.h>
using namespace std;
bool reverseVector(long long a, long long b) { return a > b; }
long long gcd(long long a, long long b) {
  long long a1 = 0;
  if (b == 0)
    return a;
  else {
    a1 = a % b;
    return gcd(b, a1);
  }
}
bool isPrime(long long num) {
  long long n = 1000001;
  vector<bool> seive(n);
  for (long long i = 0; i < n; i++) seive[i] = true;
  for (long long i = 2; i * i <= n; i++) {
    if (seive[i] == true) {
      for (long long j = i * i; j <= n; j++) seive[j] = false;
    }
  }
  if (seive[num] == true)
    return true;
  else
    return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long initial = 2;
  long long x = 2;
  long long num = n;
  n--;
  while (n--) {
    cout << initial << " ";
    if (initial + x == num) {
      initial = num;
      x++;
      continue;
    }
    initial = (initial + x) % num;
    x++;
  }
}
