#include <stdio.h>

// Hypotheses for this function:
// Jack: O(n²*log n)
// Student: O(n*log² n)
// Truth: O(n²)

int f4(int n) { 
    int c = 0;
    for (int j = 0; j < n; j++) {
	for (int step = n; step > 0; step /= 3)
	    for (int i = 0; i < step; i++)
		c++;
	for (int k = 0; k < 100; k++)
	    c++;
    }
    return c;
}

int main() {
    for (int n=10; n<10000; n*=1.3)
	printf("%5d %9d %9d\n", n, f4(n), n*(n*3/2+100));
    return 0;
}