/*
   ACM North Central Region, 1994-95
   Problem A, Mapping the Swaps

   Ed Karrels, May 1996
*/

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

void swap(int *a, int i) {
   int t;
   t = a[i];
   a[i] = a[i+1];
   a[i+1] = t;
}

int bub_srt(int n, int b[]) {
   int *a, ns=0, i, j;

   a = (int*)malloc(sizeof(int) * n);
   for (i=0; i<n; i++) a[i] = b[i];
   
   for (i=n-1; i>0; i--) {
      for (j=0; j<i; j++) {
	 if (a[j] > a[j+1]) {
	    swap(a, j);
	    ns++;
	 }
      }
   }

   return ns;
}


int try(int n, int *a, int depth) {
   int i, ns=0;

   if (!depth) {
      for (i=0; i<n-1; i++) {
	 if (a[i] > a[i+1]) return 0;
      }
      return 1;
   }

   for (i=0; i<n-1; i++) {
      swap(a, i);
      ns += try(n, a, depth-1);
      swap(a, i);
   }

   return ns;
}
   
   


int main() {
   int set_no=1;
   int n, *a, ns, min_ns, i;

   scanf("%d", &n);
   while (n) {
      a = (int*)malloc(sizeof(int) * n);
      for (i=0; i<n; i++) {
	 scanf("%d", a+i);
      }

      min_ns = bub_srt(n, a);
      ns = min_ns ? try(n, a, min_ns) : 0;

      printf("There are %d swap maps for input data set %d.\n", ns, set_no++);

      scanf("%d", &n);
   }

   return 0;
}