Glenbow Museum LA4123

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>   
#include <ctime>
 
using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;
using std::endl;

typedef long long LL;
const int MAXN(1000);
LL table[MAXN+10][MAXN+10][2][2];

int main()
{
	table[0][1][1][1] = 1LL;
	for(int i = 1; i <= MAXN; ++i)
		table[i][0][0][0] = 1LL;
	for(int i = 1; i <= MAXN; ++i)
		for(int j = 1; j <= MAXN; ++j)
		{
			table[i][j][0][0] = table[i-1][j][0][1]+table[i-1][j][0][0];
			table[i][j][1][0] = table[i-1][j][1][1]+table[i-1][j][1][0];
			table[i][j][0][1] = table[i][j-1][0][0];
			table[i][j][1][1] = table[i][j-1][1][0];
		}
	int n;
	int n_case(0);
	while(scanf("%d", &n), n)
	{
		if((n&1) || n < 4)
			printf("Case %d: 0\n", ++n_case);
		else
			printf("Case %d: %lld\n", ++n_case, table[n/2+2][n/2-2][0][0]+table[n/2+2][n/2-2][1][0]+table[n/2+2][n/2-2][0][1]);
	}
	return 0;
}