Bi-shoe and Phi-shoe

Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his students, so he asked his assistant Bi-Shoe to go to the market and buy them. Plenty of Bamboos of all possible integer lengths (yes!) are available in the market. According to Xzhila tradition,

Score of a bamboo = Φ (bamboo's length)

(Xzhilans are really fond of number theory). For your information, Φ (n) = numbers less than n which are relatively prime (having no common divisor other than 1) to n. So, score of a bamboo of length 9 is 6 as 1, 2, 4, 5, 7, 8 are relatively prime to 9.

The assistant Bi-shoe has to buy one bamboo for each student. As a twist, each pole-vault student of Phi-shoe has a lucky number. Bi-shoe wants to buy bamboos such that each of them gets a bamboo with a score greater than or equal to his/her lucky number. Bi-shoe wants to minimize the total amount of money spent for buying the bamboos. One unit of bamboo costs 1 Xukha. Help him.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 10000) denoting the number of students of Phi-shoe. The next line contains n space separated integers denoting the lucky numbers for the students. Each lucky number will lie in the range [1, 106].

Output

For each case, print the case number and the minimum possible money spent for buying the bamboos. See the samples for details.

Sample Input

3

5

1 2 3 4 5

6

10 11 12 13 14 15

2

1 1

Sample Output

Case 1: 22 Xukha

Case 2: 88 Xukha

Case 3: 4 Xukha

题意涉及欧拉函数，但是这道题和那个没有什么大关系，你先打个素数表（怎么打都可以的），然后你按照他的输入，给你T组数据，然后给你n个数字，每个数字取比他大的最近素数，然后把这素数求和格式输出就可以了。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define N 1000010
bool book[N]={0};
void cn()
{
    book[1]=1;
    for(long long i=2; i<=sqrt(N); i++)
    {
        if(!book[i])
        {
            for(long long j=i*i;j<N;j+=i)
                book[j]=1;
        }
    }
}
int main()
{
    cn();
    long long int n,m=1;
    scanf("%lld",&n);
    while(n--)
    {
        long long int a,b,c=0;
        scanf("%lld",&a);
        for(long long int i=0; i<a; i++)
        {
            scanf("%lld",&b);
            for(long long int j=b+1; j<N; j++)
            {

                if(!book[j])
                {
                    c+=j;
                    break;
                }
            }
        }
        printf("Case %lld: %lld Xukha\n",m++,c);
    }
    return 0;
}