#include <iostream>
#include <cstdio>

using namespace std;

int n;

struct T
{
    int key, prioritate;
    T *left, *right;
    T() {};
    T(int key, int prioritate, T*left, T*right)
    {
        this->key = key;
        this->prioritate = prioritate;
        this->left = left;
        this->right = right;
    }
}*R, *nil;

void initialize(T*&R)
{
    R = new T(2, 1, NULL, NULL);
}

void insertNode(T*&n, int key, int prioritate)
{

}

void read()
{
    scanf("%d", &n);
    initialize(R);
    for(int i=1; i<=n; ++i)
        insertNode(R, (R->key + i)%n, i);
}

int main()
{
    freopen("order.in", "r", stdin);
    //freopen("order.out", "w", stdout);
    read();
    return 0;
}