#include<stdio.h>

#include<iostream>

#include<sstream>

#include<queue>

#include<map>

#include<memory.h>

#include <math.h>

#include<time.h>

#include <stdlib.h>

#include <algorithm>

using namespace std;

int n;

int a[10];

int total = 0;

void swap(int s, int e)

{

	int t;

	t = a[s];

	a[s] = a[e];

	a[e] = t;

}

int ok = 0;

int search()

{

	for(int i = 0; i < n - 1; i++)

	{

		if(a[i] > a[i + 1])

		{

			swap(i,i+1);

			ok=1;

			search();

			ok=0;

			swap(i,i+1);

		}

	}

	if(ok)

		total++;

	return 0;

}

int main()

{

	freopen("d:\\1.txt", "r", stdin);

	string str="There are %d swap maps for input data set %d.\n";

	int t = 0;

	while (cin >> n && n)

	{

		total = 0;

		++t;

		for(int i = 0; i < n; i++)

			cin >> a[i];

		search();

		printf(str.c_str(),total,t);

	}

	return 0;

}