1. 

/**
 * FWP, Ausgewählte Probleme aus dem ACM Programming Contest, WS10/11 
 * Problem: 11636 - Hello World!
 * Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=78&page=show_problem&problem=2683
 * 
 * @author Manuel Hager
 * @version 1.0, 10/11/2010
 * 
 * Method : Ad-Hoc
 * Status : Accepted
 * Runtime: 0.764
 */

import java.io.*;

public class Main 
{

	public static void main(String[] args) 
	{
		try
		{
			BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
			
			int counter = 0;
			
			for(String line = reader.readLine(); line != null && counter++ < 2000; line = reader.readLine())
			{
				//max: 10001
				int number = Integer.parseInt(line);
				
				if(number < 0) {
					break;
				}
				
				System.out.printf("Case %d: %d%n", counter, calc(number));
			}
			
			reader.close();
		}
		catch(IOException ex)
		{}
	}
	
	private static int calc(int number)
	{
		int result = (int)(Math.log(number) / Math.log(2d));
		
		if((1 << result) == number)
			return result;
		
		return result + 1;
	}
}