#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#define SZ(X) ((int)(X).size())
using namespace std;
const int MAX_N = 500000;
int d[MAX_N];
int tmp[MAX_N];
long long dc(int L, int R) {
    if(L + 1 == R) return 0;
    int mm = L + (R - L) / 2;
    long long answer = dc(L, mm) + dc(mm, R);
    int itL = L;
    int itR = mm;
    int result_it = L;
    while(itL < mm || itR < R) {
        if(itR == R || (itL != mm && d[itL] <= d[itR])) {
            answer += itR - mm;
            tmp[result_it++] = d[itL++];
        } else {
            tmp[result_it++] = d[itR++];
        }
    }
    memcpy(d + L, tmp + L, (R - L) * sizeof(int));
    return answer;
}
int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int n;
    int case_num = 0;
    while(cin >> n && n) {
        for(int i = 0; i < n; i++) cin >> d[i];
        cout << "Case #" << ++case_num << ": " << dc(0, n) << '\n';
    }
}