UVALive 4853 Emoogle Balance

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int a[1005];

int main()
{
int ans, cnt = 1, n;
while(~scanf("%d", &n))
{
ans = 0;
if(n == 0)
break;
int b;
for(int i = 0; i < n; i++)
{
scanf("%d", &b);
if(b == 0)
ans--;
else
ans++;
}
printf("Case %d: %d\n", cnt++, ans);
}
}