#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

const int MAX = 1e5 + 10;
const int mod = 1e9 + 7;

int n;
long long sum;
int a[MAX];
int ssum[MAX];
int Max, Min;

bool notp[MAX];
int prime[MAX], pnum, mu[MAX];

void Moblus()
{
	memset(notp, 0, sizeof(notp));
	mu[1] = 1;
	for (int i = 2; i < MAX; i++)
	{
		if (!notp[i])
		{
			prime[++pnum] = i;
			mu[i] = -1;
		}
		for (int j = 1; prime[j] * i < MAX; j++)
		{
			notp[prime[j] * i] = 1;
			if (i%prime[j] == 0)
			{
				mu[prime[j] * i] = 0;
				break;
			}
			mu[prime[j] * i] = -mu[i];
		}
	}
	for (int i = 0; i < MAX; i++)
		mu[i] = -mu[i];
}

long long fastpow(long long p, int m)
{
	if (p == 1 || m == 0)
		return 1;
	if (p == 0)
		return 0;
	long long res = 1;
	while (m)
	{
		if (m & 1)
			res = res*p%mod;
		p = p*p%mod;
		m >>= 1;
	}
	return res;
}

int main()
{
	int T, Case = 1;
	Moblus();
	scanf("%d", &T);
	while (T--)
	{
		sum = 0;
		scanf("%d", &n);
		memset(ssum, 0, sizeof(ssum));
		Min = MAX;
		Max = -1;
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
			ssum[a[i]]++;
			if (Max < a[i])
				Max = a[i];
			if (a[i] < Min)
				Min = a[i];
		}
		printf("Case #%d: ", Case++);
		for (int i = 1; i <= Max; i++)
			ssum[i] += ssum[i - 1];

		long long res = 1;
		for (int i = 2; i <= Min; i++)
		{
			res = 1;
			if (mu[i] == 0)
				continue;
			int j = min(i, Max);
			int k = min(i * 2 - 1, Max);
			for (int p = 1;; p++)
			{
				if (ssum[k] - ssum[j - 1] != 0)
					res = res*fastpow(p, ssum[k] - ssum[j - 1]) % mod;
				if (k == Max)
					break;
				j += i;
				k += i;
				if (k > Max)
					k = Max;
			}
			sum = ((sum + mu[i] * res) % mod + mod) % mod;
		}

		printf("%lld\n", sum);
	}
	return 0;
}