#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<algorithm>

 using namespace std;

 typedef long long LL;

 const int maxn=;

 int sum[maxn];

 void build(int p){

     int v;

     cin>>v;

     if(v==-) return;

     sum[p]+=v;

     build(p-);//建左子树

     build(p+);//建右子树

 }

 bool init(){

     int v;

     cin>>v;

     if(v==-) return false;

     memset(sum,,sizeof(sum));

     int pos=maxn/;

     sum[pos]=v;

 //    printf("init被调用\n");

     build(pos-);build(pos+);

 }

 int main()

 {

     int kase=;

     while(init()){

         int p=;

         while(sum[p]==) p++;

         cout<<"Case "<<++kase<<":\n"<<sum[p++];

         while(sum[p]!=) cout<<" "<<sum[p++];

         cout<<"\n\n";

     }

     return ;

 }