#include <stdio.h>

 #include <string.h>

 #include <stdlib.h>

 #include <algorithm>

 #include <iostream>

 #include <queue>

 #include <stack>

 #include <vector>

 #include <map>

 #include <set>

 #include <string>

 #include <math.h>

 using namespace std;

 #pragma warning(disable:4996)

 typedef long long LL;

 const int INF = <<;

 /*

 */

 const int MOD = ;

 int a[ + ];

 LL ans;

 bool cmp(LL a, LL b)

 {

     while (a || b)

     {

         if ((a & ) != (b & ))

             return (a & ) < (b & );

         a >>= ;

         b >>= ;

     }

     return false;

 }

 void dfs(int from, int to, int pos)

 {

     if (pos>) return;

     if (from > to) return;

     int i;

     for ( i = from; i <= to; ++i)

     {

         //找到集合的分割点

         if (a[i] & ( << pos))

             break;

     }

     ans = ans + (i - from)*(to - i + )*( << pos) % MOD;

     //递归求解分割出来的两个集合

     dfs(from, i - , pos + );

     dfs(i, to, pos + );

 }

 int main()

 {

     int t, n, i;

     scanf("%d", &t);

     for (int k = ; k <= t; ++k)

     {

         scanf("%d", &n);

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

         {

             scanf("%d", &a[i]);

         }

         ans = ;

         sort(a, a + n,cmp);

         dfs(, n - , );

         ans = ans *  % MOD;

         printf("Case #%d: %d\n",k, ans);

     }

     return ;

 }