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

int stupid_sort(int *arr, size_t length)
{
    int counter = 0;
    size_t idx = 0;
    while (idx < length-1)
    {
        ++counter;
        if (arr[idx] > arr[idx+1])
        {
        swap(arr[idx], arr[idx+1]);
        idx = 0;
        continue;
    }
    ++idx;
    }
    return counter;
}

int main()
{
    int n = 0;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; ++i)
    {
        arr[i] = n-i;
    }
    int counter = stupid_sort(arr, n);
    cout << "n: " << n << "; n^3: " << n*n*n << "; ops: " << counter << "; log_n(ops): " << (log(counter)/log(n)) << "\n";

}