//reproduction
//rank
//previous rank 1365
#include <stdio.h>
#include <math.h>
int main ()
{
int n;
int cases = 0;
while ( scanf ("%d", &n) && n >= 0 ) {
printf ("Case %d: %0.lf\n", ++cases, ceil (log (n) / log (2)));
}
return 0;
}
