#include <iostream>
#include <cassert>
#include <cstdio>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <stack>
#include <list>
using namespace std;
typedef long long li;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;

#define mp make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
li solve();

int main() {
    FILE* x = freopen("input", "r", stdin);
#ifdef DEBUG

    clock_t start = clock();
#else
    x = freopen("output", "w", stdout);
#endif
    (void)x;
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    string s;
    getline(cin,s );
    for(int i = 1; i <= t; ++i){
        cout << "Case #" << i << ": " << solve() << '\n';
    }

#ifdef DEBUG
    cout << "\n\n\nTime:" << ((clock() - start) / 1.0 / CLOCKS_PER_SEC);
#endif
    return 0;
}

li a[10101];

li solve(){
    int n;
    cin >> n;
    li ans = n + 1;
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        ++a[i];
        ans += a[i] * (a[i] - 3) / 2 + 1;
    }

    for(int i = 0; i < n; ++i)
        for(int j = i + 1; j < n; ++j){
           // cerr << a[i] * a[j] << endl;
            ans += a[i] * a[j];
        }


    return ans;
}