import java.util.Scanner;


public class fourTowers {
/*	public static long numberMoves(int n){
		if(n==1) return 1;
		long min= Long.MAX_VALUE;
		long power=1;
		for(int i=1;i<n;i++){
			power=power*2;
			long m=2*numberMoves(n-i) + power-1;
			if(m<min) min=m;
		}
		return min;
	}*/
	static Scanner in=new Scanner(System.in);
	public static void main(String[] args) {
		int n;
		long[] moves = new long[1001];
		moves[1]=1;
		for(int i=2;i<=1000;i++){
			moves[i]=Long.MAX_VALUE;
			long power=1;
			for(int j=1;j<i;j++){
				if (power>=Long.MAX_VALUE/2) break;
				power=power*2;
				long m=2*moves[i-j]+power-1;
				if(m<moves[i]) moves[i]=m;
			}
		}
		int i=0;
		while(in.hasNextInt()){
			n=in.nextInt();
			i++;
			System.out.println("Case "+i+": "+moves[n]);
		}
	}
}