#include<cstdio>

int p[100], r[100], N, i, j;
bool t = 0;

void change(int x)
{
	if ( x < 1) return;
	int pom[100];
	for (j = 0; j <= x; j++) pom[j] = p[j];
	for (j = 0; j <= x; j++) p[j] = pom[x-j];
	/*for (j = 0; j <= x; j++) printf (" %d", p[j]);
	putchar (10);*/
	if (t) putchar(' '); else t = 1;
	printf ("%d", x + 1);
	return ;
}

int main()
{
	while (1)
	{
		t = 0;
		scanf("%d", &N);
		if (N == 0) break;
		for (i = 0; i < N; i++) scanf("%d", &p[i]);
		for (i = 0; i < N; i++) scanf("%d", &r[i]);
		N--;
		while (N >= 0)
		{
			while (N >= 0 && p[N] == r[N]) N--;
			if (N < 0) break;
			for ( i = 0; i < N; i++)
				if (p[i] == r[N]) break;
			change(i);
			change(N);
		}
		putchar (10);
	}
	return 0;
}