#include <bits/stdc++.h>
using namespace std;
const long long N = 105;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
void vecdisp(vector<long long> v) {
  for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
}
void arrdisp(long long a[], long long n) {
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
}
void sarrdisp(string s[], long long n) {
  for (long long i = 0; i < n; i++) cout << s[i] << "\n";
}
void twodarrdisp(long long *a, long long r, long long c) {
  for (long long i = 0; i < r; i++) {
    for (long long j = 0; j < c; j++) cout << (*((a + i * c) + j)) << " ";
    cout << "\n";
  }
}
void setdisp(set<long long> s) {
  for (auto it = s.begin(); it != s.end(); ++it) cout << " " << *it;
}
long long nod(long long a) {
  long long c = 0;
  set<long long> s;
  while (a > 0) {
    ++c;
    s.insert(a % 10);
    a /= 10;
  }
  if (s.size() == c)
    return 1;
  else
    return 0;
}
long long sod(long long a) {
  long long c = 0;
  while (a > 0) {
    c += a % 10;
    a /= 10;
  }
  return c;
}
bool isComposite(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return false;
  if (n % 2 == 0 || n % 3 == 0) return true;
  for (long long i = 5; i * i <= n; i += 6) {
    if (n % i == 0 || n % (i + 2) == 0) return true;
  }
  return false;
}
long long countDivisors(long long n) {
  long long cnt = 0;
  for (long long i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        cnt++;
      else
        cnt += 2;
    }
  }
  return cnt;
}
long long isPalindrome(string s) {
  long long l = s.size();
  long long flag = 0;
  for (long long i = 0; i < l; i++) {
    if (s[i] != s[l - i - 1]) {
      flag = 1;
      break;
    }
  }
  if (flag)
    return 0;
  else
    return 1;
}
void solve() {
  long long n;
  cin >> n;
  long long j = 1, nextchild;
  for (long long i = 1; i < n; i++) {
    nextchild = (j + i) % n;
    cout << (nextchild == 0 ? n : nextchild) << " ";
    j = nextchild;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t = 1;
  if (!t) cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
