#include <stdio.h>
#include <stdlib.h>
#include <string.h>


#define SCORES 2
static int bj[SCORES], bv[SCORES];

int main (int argc, char **argv)
{
	int n = 1<argc ? atoi(argv[1]) : 100;
	int trace = 2<argc ? atoi(argv[2]) : 0;
	int *seen = (int*)malloc(n*sizeof *seen); /* [n], seen positions */
	int i, j, k;

	for (j=n; --j; ) {
		int s[SCORES];

		memset(seen, 0, n*sizeof i);
		seen[0] = 1;
		for (i=SCORES; i--; ) s[i] = 0;

		for (i=1; i<n; i++) {
			int p = (i*j) % n, d;
			if (seen[p]) break; /* cycle, mindist = 0, no more score */
			seen[p] = 1;
			for (d=1; d<n; d++)
				if (seen[(p+d)%n] || seen[(p+n-d)%n]) break;
			/* note d is also alway the min. distance seen so far - never increases! */
			s[0] += d; /* sum of minimal distances */
			s[1] += d * (n-i); /* weighted sum *(n-i) in i'th step */
			/* any more reasonable scores ? */
			if (trace != j) continue;
			fprintf(stderr, "%d\t%d", i, d);
			for (k=0; k<SCORES; k++) fprintf(stderr, "\t%d", s[k]);
			fprintf(stderr, "\n");
		}
		for (k=0; k<SCORES; k++) {
			printf("%d\t", s[k]);
			if (bv[k] < s[k]) {
				bv[k] = s[k];
				bj[k] = j;
			}
		}
		printf("%d\n", j);
	}

	if (!trace)
		for (k=0; k<SCORES; k++)
			fprintf(stderr, "%d\t%d\n", bj[k], bv[k]);
	return 0;
}