uva 699

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;

const int maxn = 10000;
int tree[maxn];
bool flag = true;

bool input(int p){
int n;
cin>>n;
if(n==-1) return false;
if(flag == true){
memset(tree,0,sizeof(tree));
tree[p] = n;
flag = false;
}
else {
tree[p] += n;
}
input(p-1);input(p+1);
return true;
}

int main(){
int kase = 0;
while(input(maxn/2)){
int p = 0;
while(tree[p] == 0) p++;
cout<<"Case "<<++kase <<":\n"<<tree[p++];
while(tree[p] != 0) cout<<" "<<tree[p++];
cout<<"\n\n";
flag = true;
}
return 0;
}