UVA699

#include <bits/stdc++.h>
using namespace std;


#define LL long long
#define INF 0x3f3f3f3
#define pi acos(-1)
const int maxn=1e3+5;
const int maxx=1e6+5;

int sum[maxn];
void build(int p)
{
    int v;
    cin>>v;
    if(v==-1)
        return ;
    sum[p]+=v;
    build(p-1);
    build(p+1);
}

bool init()
{
    int v;
    cin>>v;
    if(v==-1)
        return false;
    memset(sum,0,sizeof(sum));
    int pos=maxn/2;
    sum[pos]=v;
    build(pos-1);
    build(pos+1);
}



void solve()
{
    int Case=0;
    while(init())
    {
        int p=0;
        while(sum[p]==0)
           p++;
        cout<<"Case "<<++Case<<":"<<endl<<sum[p++];
        while(sum[p]!=0)
            cout<<" "<<sum[p++];
        cout<<"\n\n";
    }
}
int main()
{
    solve();
}