ICPC Kanpur Practice Q2

/******************************************
* AUTHOR : Lokesh goel*
* NICK : InsaneNerd *
* INSTITUTION : NIT Kurukshetra *
******************************************/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAX 1000000000
#define N 100005
#define pii pair<int,int>
#define vp vector<pair<int,int > >
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define gsz(x) ((int)(x).size())
#define F first
#define S second
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);cerr.tie(NULL);
#define endl "\n"
#define ms(x,v) memset(x,v,sizeof(x))

int main()
{
    fastio;
    int t;
    cin>>t;
    //t=1;
    for(int x = 1;x<=t;x++){
       ll k,i,j;
       cin>>k;
       vector<ll>v(k);

       for(i=0;i<k;i++){
        cin>>v[i];
       }
       ll gcdVal = v[0];
       ll lcmVal  =v[0];
       ll maxi = v[0];
       ll mini = v[0];
       for(i = 1;i<k;i++){
        gcdVal = __gcd(lcmVal, v[i]);
        lcmVal *= (v[i]/gcdVal);
        maxi = max(maxi,v[i]);
        mini = min(mini, v[i]);
       }
       if(lcmVal == maxi){
        cout<<"Case "<<x<<": "<<lcmVal*mini<<endl;
       }
       else{
        cout<<"Case "<<x<<": "<<lcmVal<<endl;
       }



    }
    return 0;
}