#include <vector> 
#include <list> 
#include <map> 
#include <set> 
#include <deque> 
#include <queue> 
#include <stack> 
#include <bitset> 
#include <algorithm> 
#include <functional> 
#include <numeric> 
#include <utility> 
#include <sstream> 
#include <iostream> 
#include <iomanip> 
#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <cctype> 
#include <string> 
#include <cstring> 
#include <ctime> 

using namespace std;

#define _int64 long long

vector<int> a;

_int64 solve(int x,int y,int bit)
{
  if (bit==-1) return 0;
  if (x>y) return 0;
  int i,left,right,mid;
  _int64 ret;
  left=x-1;right=y+1;
  while (right-left>1)
  {
    mid=(left+right)/2;
    if ((a[mid]&(1<<bit))==0) left=mid;
    else right=mid;
  }
  //cout<<bit<<" "<<x<<" "<<left<<" "<<right<<" "<<y<<endl;
  ret=(1LL<<(29-bit))*(left-x+1)*(y-right+1);
  ret+=solve(x,left,bit-1);
  ret+=solve(right,y,bit-1);
  return ret;
}

int main()
{
  int l,t,i,n,x,j,y;
  _int64 ans;
  scanf("%d",&t);
  for (l=0;l<t;l++)
  {
    scanf("%d",&n);
    a.clear();
    for (i=0;i<n;i++)
    {
      scanf("%d",&x);
      y=0;
      for (j=0;j<=29;j++)
        if (((1<<j)&x)!=0)
          y|=(1<<(29-j));
      a.push_back(y);
    }
    sort(a.begin(),a.end());
    /*
    for (i=0;i<a.size();i++)
      cout<<a[i]<<" ";
    cout<<endl;
    */
    ans=solve(0,n-1,29);
    ans*=2;
    ans%=998244353;
    cout<<"Case #"<<l+1<<": "<<ans<<endl;
  }
  return 0;
}