#include <bits/stdc++.h>//zero a679
using namespace std;
const int MaxN=3e5;
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;//Cn取2
for(int m=0,n=0;n<N;n++){//m終點 n起點
while(m<N && e[m]<=s[n])
m+=1;
ans-=m;
}
cout<<"Case "<<t<<": "<<ans<<endl;
}
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Ly96ZXJvIGE2NzkKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBNYXhOPTNlNTsKaW50IE47CmludCBzW01heE5dOwppbnQgZVtNYXhOXTsKCmludCBtYWluKCkgewoJZm9yKGludCB0PTE7Y2luPj5OO3QrKyl7CgkJZm9yKGludCBuPTA7bjxOO24rKykKCQkgIGNpbj4+c1tuXT4+ZVtuXTsKCQlzb3J0KHMscytOKTsKCQlzb3J0KGUsZStOKTsKCQlpbnQgYW5zPU4qKE4tMSkvMjsvL0Nu5Y+WMgoJCWZvcihpbnQgbT0wLG49MDtuPE47bisrKXsvL23ntYLpu54gbui1t+m7ngoJCQl3aGlsZShtPE4gJiYgZVttXTw9c1tuXSkKCQkJICBtKz0xOwoJCQlhbnMtPW07CgkJfQoJCWNvdXQ8PCJDYXNlICI8PHQ8PCI6ICI8PGFuczw8ZW5kbDsKCX0KfQ==