#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[500005];
struct node
{
    int x,y;
}s[500005];

bool cmp(node a,node b)
{
    return a.x<b.x;
}

int main()
{
    int ant=0,n,i,j,c;
    while(~scanf("%d",&n))
    {
        ant++;
        for(i=0;i<n;i++)
            scanf("%d%d",&s[i].x,&s[i].y);
        sort(s,s+n,cmp);
        c=0;dp[c]=s[0].y;//二分开始。
        for(i=1;i<n;i++)
        {
            if(dp[c]<s[i].y)
            {
                dp[++c]=s[i].y;
            }
            else
            {
                int l,r,mid;
                l=0;r=c;
                while(l<r)
                {
                  mid=(l+r)/2;
                  if(dp[mid]<s[i].y)  l=mid+1;
                  else r=mid;
                }
                mid=r;
                dp[mid]=s[i].y;
            }
        }
        if(c==0)printf("Case %d:\nMy king, at most %d road can be built.\n\n",ant,c+1);
        else printf("Case %d:\nMy king, at most %d roads can be built.\n\n",ant,c+1);
    }
    return 0;
}