#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c = getchar(); x = ;while(!isdigit(c)) c = getchar();

    while(isdigit(c)) { x = x *  + c - ''; c = getchar();  }

}

int a[],b[];

LL h[(<<)+];

struct X

{

    int b, nx;

}e[];

int g[],k;

void add(int a,int b)

{

    e[k].b=b; e[k].nx=g[a]; g[a]=k++;

}

int main()

{

    int cas=;

    while(~scanf("%d",&a[]))

    {

        if(a[]==) break;

        for(int i=;i<=;i++) scanf("%d",&a[i]);

        k=; memset(g,-,sizeof g);

        for(int i=;i<(<<);i++)

        {

            int t=i,cnt=;

            for(int j=;j<;j++) if(i&(<<j)) b[cnt++]=j;

            if(cnt!=) continue;

            sort(b,b+);

            do

            {

                add(*a[b[]]+*a[b[]]+*a[b[]]+*a[b[]],i);

            }while(next_permutation(b,b+));

        }

        memset(h,,sizeof h);

        for(int i=;i<=;i++)

        {

            for(int j=g[i];j!=-;j=e[j].nx)

            {

                for(int d=e[j].nx;d!=-;d=e[d].nx)

                {

                    int f1=e[d].b,f2=e[j].b;

                    if(f1&f2) continue;

                    h[f1^f2]++;

                }

            }

        }

        LL ans=;

        for(int i=;i<(<<);i++)

        {

            int t=i,cnt=;

            for(int j=;j<;j++) if(i&(<<j)) cnt++;

            if(cnt!=) continue;

            ans=ans+h[i]*h[(<<)--i];

        }

        printf("Case %d: %lld\n",cas++,ans/);

    }

    return ;

}