#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define modul 998244353
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,bit[300005],m;
void update(ll pos,ll val){
for(;pos<=m;pos+=pos&(-pos)){
    bit[pos]+=val;
}
}
ll query(ll pos){
ll rs=0;
for(;pos>=1;pos-=pos&(-pos)){
    rs+=bit[pos];
}
return rs;
}
int32_t main(){
CODE_START;
ifstream cin("order.in");
ofstream cout("order.out");
cin>>n;
m=n;
ll pos=1;
for(ll i=1;i<=n;i++)
{
    update(i,1);
}
for(ll i=1;i<=m;i++)
{
    pos=pos+(i-1);
    pos=pos%n;
    ll l=1,r=m,ans=0;
    while(l<=r){
        ll mid=(l+r)/2;
        if(query(mid)<pos+1){
            l=mid+1;
        }else {
        ans=mid;
        r=mid-1;
        }
    }
    cout<<ans<<' ';
    update(ans,-1);
n--;
}
}