#include <bits/stdc++.h>
using namespace std;
const int MaxN=3e4;
int N;
int s[MaxN];
int e[MaxN];
int main (){
for(int t=1;cin>>N;t++){
for(int n=0;n<N;n++)
cin>>s[n]>>e[n];
sort(s,s+N);
sort(e,e+N);
int ans=N*(N-1)/2;
for(int m=0,n=0;n<N;n++){
while(m<N && e[m]<=s[n])
m++;
ans-=m;
}
cout<<"Case "<<t<<": "<<ans<<"\n";
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpjb25zdCBpbnQgTWF4Tj0zZTQ7CgppbnQgTjsKaW50IHNbTWF4Tl07CmludCBlW01heE5dOwppbnQgbWFpbiAoKXsKCWZvcihpbnQgdD0xO2Npbj4+Tjt0KyspewoJCWZvcihpbnQgbj0wO248TjtuKyspCgkJCWNpbj4+c1tuXT4+ZVtuXTsKCQlzb3J0KHMscytOKTsKCQlzb3J0KGUsZStOKTsKCQlpbnQgYW5zPU4qKE4tMSkvMjsKCQlmb3IoaW50IG09MCxuPTA7bjxOO24rKyl7CgkJCXdoaWxlKG08TiAmJiBlW21dPD1zW25dKQoJCQkgIG0rKzsKCQkJYW5zLT1tOwoJCX0KCQljb3V0PDwiQ2FzZSAiPDx0PDwiOiAiPDxhbnM8PCJcbiI7Cgl9CglyZXR1cm4gMDsKfQ==