#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll N=100000;
const ll mod=998244353;
ll a[N],same[30];
ll R(ll x)
{
    ll ret=0;
    for(ll i=0,base=1;i<30;i++,base*=2)
    {
        if(x&base)
        {
            ret=ret|(1<<(29-i));
        }
    }
    return ret;
}
int main()
{
    ll T,n,i,ans,cas,t,base,j;
    cin>>T;
    for(cas=1;cas<=T;cas++)
    {
        ans=0;
        cin>>n;
        for(i=0;i<n;i++)
        {
            cin>>t;
            a[i]=R(t);
        }
        sort(a,a+n);
        same[0]=(n*(n-1))%mod;
        ll base=0;
        for(i=0;i<30;i++)
        {
            ll k=0,cnt=0,m;
            base+=(1<<(29-i));
            for(j=1;j<=n;j++)
            {
                ll t1=a[k]&base;
                ll t2=a[j]&base;
                if(j==n||(t1!=t2))
                {
                    m=j-k;
                    cnt=(cnt+m*(m-1))%mod;
                    k=j;
                }
            }
            same[i+1]=cnt;
        }
        for(i=1;i<30;i++)
            ans=(ans+(same[i-1]-same[i])*(1<<(i-1))+mod)%mod;
        cout<<"Case #"<<cas<<": "<<(ans+mod)%mod<<endl;
    }
    return 0;
}