#include <bits/stdc++.h>
using namespace std;

//lca
ifstream fin("order.in");
ofstream fout("order.out");

int n;
int aib[30005], aib1[30005];

void Update(int p, int x, int aib[])
{
    while (p <= n)
    {
        aib[p] += x;
        p += (p & (-p));
    }
}
int Query(int p, int aib[])
{
    int suma = 0;
    while (p >= 1)
    {
        suma += aib[p];
        p -= (p & (-p));
    }
    return suma;
}
int CB(int val)
{
    int st, dr, mij, Poz, Q;
    st = 1; dr = n;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        Q = Query(mij, aib);
        if (Q >= val)
        {
            Poz = mij;
            dr = mij - 1;
        }
        else 
            st = mij + 1;
    }
    return Poz;
}

int main()
{
    int i, Elimina, Poz, Last;
    fin >> n;
    for (i = 1; i <= n; i++)
        Update(i, 1, aib);

    Last = 1;
    for (i = 1; i <= n; i++)
    {
        Elimina = (Last + i - Query(Last, aib1)) % (n - i + 1);

        cout << Elimina << " " << Last << "\n"; 

        if (Elimina == 0)
            Elimina++;
        Poz = CB(Elimina);
        Update(Poz, -1, aib);
        Update(Poz, 1, aib1);
        Last = Poz;
        fout << Poz << " ";
    }
}