#include <iostream>
using namespace std;

const int n = 100;
int a[n];
int b[n];
int c = 0;

void merge(int l, int m, int r)
{
	int i = l, j = m + 1, p = 0;

	while (i <= m && j <= r) if (a[i] <= a[j]) b[p++] = a[i++]; else (c += m + 1 - i, b[p++] = a[j++]);

	if (i > m) while (j <= r)b[p++] = a[j++]; else while (i <= m)b[p++] = a[i++];

	for (int k = l; k <= r; k++)a[k] = b[k - l];
}

void merge_sort(int l, int r)
{
	if (l<r)
	{
		int m = (l + r) / 2;
		merge_sort(l, m);
		merge_sort(m + 1, r);
		merge(l, m, r);
	}
}

int main()
{
	for (int i = 0; i < n; i++)a[i] = 100 - i;

	merge_sort(0, n - 1);
	for (int i = 0; i < n; i++)cout << a[i] << " ";
	cout << c << endl;

	return 0;
}