#include <cstdio>

#include <cstring>

#include <iostream>

using namespace std;

const int MAX_N =  *  + ;

int num[MAX_N];

struct Node{

    Node *child[];

    int count;

    Node(){

        count = ;

        memset(child, , sizeof(child));

    }

    Node(int value){

        count = value;

        memset(child, , sizeof(child));

    }

};

void Insert(Node *head, int value){

    Node *pre = head, *next = NULL;

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

        if (pre->child[value & ] == NULL){

            pre->child[value & ] = new Node();

            pre = pre->child[value & ];

        }else{

            next = pre->child[value & ];

            next->count++;

            pre = next;

        }

        value >>= ;

    }

}

void MakeEmpty(Node *node){

    node->count = ;

    if (node->child[])

        MakeEmpty(node->child[]);

    if (node->child[])

        MakeEmpty(node->child[]);

}

long long Query(Node *head, int value){

    Node *pre = head, *next = NULL, *other;

    long long ret = ;

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

        next = pre->child[value & ];

        other = pre->child[(value & ) ^ ];

        if (other)

            ret = (ret + other->count * ( << i)) % ;

        pre = next;

        value >>= ;

    }

    return ret;

}

int main(){

    int case_times, n;

    int case_id = ;

    scanf("%d", &case_times);

    while (case_times--){

        Node *head = new Node();

        scanf("%d", &n);

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

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

            Insert(head, num[i]);

        }

        long long ans = ;

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

            ans = (ans + Query(head, num[i])) % ;

        MakeEmpty(head);

        printf("Case #%d: %I64d\n", ++case_id, ans);

    }

    return ;

}