#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 8

int array[MAX];
int dest[MAX];   //排序结束想要的结果
int count;       //计数

//排序
void sort(int *s,int s_length){  
    int i,j,tmp;
    for(i=0; i<s_length; i++)
        for(j=i; j<s_length; j++)
            if( s[i] > s[j] ){
                tmp = s[i];
                s[i] = s[j];
                s[j] = tmp;
            }
}
//判断2个int数组的元素是否相等
int isEqual(int *s,int *d,int length){  
    int i,is_equal=1;
    for(i=0; i<length; i++)
        if( s[i] != d[i] ){ 
            is_equal = 0;
            break;
        }

    return is_equal;
}

//交换2个数的值
void swap(int *a,int *b){
    int tmp = *a;
    *a = *b;
    *b = tmp;
}

//深度优先遍历解答树
void dfs(int length,int step_num){   //length保存的是array长度-1  
    int i;
    if( isEqual(array,dest,length+1) && step_num != 0 ){  //如果没有swap一次就equal了，就证明原始输入就是排好序的;递归边界
        count++;
    }else
        for(i=0; i<length; i++)                  //i只循环到n-2(最后一个元素的前一个元素)
            if( array[i] > array[i+1] ){
                swap(&array[i], &array[i+1]);    //如果交换元素i和i+1
                dfs(length,step_num+1);
                swap(&array[i], &array[i+1]);    //如果不交换元素i和i+1
            }
}

int main(){
    int n,i,set_num = 0;

    while( scanf("%d",&n) && n != 0 ){  
        //initial
        count = 0;
        set_num++;

        for(i=0; i<n; i++){  
            scanf("%d",&array[i]);
            dest[i] = array[i];
        }

        sort(dest,n);

        dfs(n-1,0);

        printf("There are %d swap maps for input data set %d.\n",count,set_num);
    }

    return 0;
}