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

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

/**
1 2 3 4 5 6
1 2 3 4 5 6

pas1:
  x
1 1 2 3 4 5
pas2:
      x
1 1 2 2 3 4
pas3:

pas4:
pas5:
pas6:

*/

int n;
int aib[30005];

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

int main()
{
    int i, x, y, S, P, lastP;
    fin >> n;
    for (i = 1; i <= n; i++)
        Update(i, 1);
    lastP = 2;
    for (i = 1; i <= n; i++)
    {
        S = lastP - 1;
        x = Query(n) - Query(lastP - 1);
        y = i;
        if (y > x)
        {
            y -= x;
            x = Query(n);
            y %= x;
            if (y == 0)y = x;
            S = 0;
        }
        cout << i << " " << y << "\n";
        lastP = CautBin(y, S);
        Update(lastP, -1);
        fout << lastP << " ";
    }
    return 0;
}