#include <fstream>
#include <vector>
using namespace std;
ifstream fin("order.in");
ofstream fout("order.out");
int Jocul_Joseph(int n){
    vector<int> arr;
    arr.resize(n);
    for (int i=1; i<=n; i++)
        arr[i-1]=i;

    int i=1,k=2;
    while (arr.size()>1){
        fout<<arr[i]<<" ";
        arr.erase(arr.begin()+i);
        i=(i+k-1)%arr.size();
        k++;
    }
    return arr[0];
}

int main() {
    int n;
    fin>>n;
    fout<<Jocul_Joseph(n);
    return 0;
}