#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <queue>

#include <cstdlib>

#include <vector>

#include <set>

#include <map>

#define LL long long

using namespace std;

int dp[],a[];

int solve(int n)

{

    int len=,low,high,mid;

    dp[]=a[];

    for(int i=;i<=n;i++)

    {

        low=;high=len;

        while(low<=high)

        {

            mid=(low+high)/;

            if(a[i]>dp[mid])low=mid+;

            else high=mid-;

        }

        dp[low]=a[i];

        if(low>len)len=low;

    }

    return len;

}

int main()

{

    int n,x,y,cas=;

    while(scanf("%d",&n)>)

    {

        for(int i=;i<=n;i++)

        {

            scanf("%d%d",&x,&y);

            a[x]=y;

        }

        int ans=solve(n);

        printf("Case %d:\n",cas++);

        if(ans==)

             printf("My king, at most 1 road can be built.\n");

        else

             printf("My king, at most %d roads can be built.\n",ans);

         printf("\n");

    }

}