#include<iostream>#include<queue>#include<iomanip>using namespace std;struct P
{
int num,key;
};int main()
{
int n,c,id=1,i;
P p,y;
queue<P> q;
int d[100];
while(cin>>n)
{
for(i=0;i<n;i++)
{
p.num=i;
cin>>p.key;
q.push(p);
}
c=0;
cout<<"Case "<<id++<<":"<<endl;
while(!q.empty())
{
p=q.front();
d[c]=p.num+1;
q.pop();
p.key=p.key -1;
while(p.key--)
{
if(q.empty())
break;
y=q.front();
q.pop();
q.push(y);
}
c++;
}
for(i=0;i<c-1;i++)
cout<<d[i]<<' ';
cout<<<d[c-1]<<endl;
}
return 0;
}