#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 1e5, M = 9917;
int v[N + 1], aux[N + 1];

int interclasare(int v[], int st, int dr) {
    int m = (st + dr) / 2, nrInv = 0, i = st, j = m + 1, k = st;

    while(i <= m && j <= dr) {
        if(v[i] <= v[j])
            aux[k++] = v[i++];
        else {
            nrInv = (nrInv + m - i + 1) % M;
            aux[k++] = v[j++];
        }
    }
    while(i <= m)
        aux[k++] = v[i++];
    while(j <= dr)
        aux[k++] = v[j++];
    for(int i = st; i <= dr; i++)
        v[i] = aux[i];

    return nrInv;
}

int ms(int v[], int st, int dr) {
    if(st == dr)
        return 0;
    int m = (st + dr) / 2, nrInv = 0;

    nrInv += ms(v, st, m);
    nrInv += ms(v, m + 1, dr);
    nrInv += interclasare(v, st, dr);

    return 0;
}

int main()
{
    int n;
    fin >> n;

    for(int i = 1; i <= n; i++)
        fin >> v[i];

    ms(v, 1, n);

    for(int i = 1; i <= n; i++)
        fout << v[i] << ' ';

    return 0;
}