10487

#include <stdio.h>
#include <stdlib.h>
#include <string.h>


int main()
{
    int n,num[1005],m[30],que,i,j,sum[100000],k,l,min,tm,closest,cas=0,a;
    while(1)
    {
        scanf("%d",&n);
        if( n == 0)
        {
            break;
        }
        i = 0;
        for(a=0;a<n;a++)
        {
            scanf("%d",&num[i]);
            i++;
        }
        k = i;
        l = 0;
        for(i=0; i<k; i++)
        {
            for(j=i+1; j<k; j++)
            {
                sum[l] = num[i] + num[j];
                l++;
            }
        }
        scanf("%d",&que);
        j = 0;
        while(que--)
        {
            scanf("%d",&m[j]);
            j++;
        }
        k = j;
        printf("Case %d:\n",++cas);
        for(j=0; j<k; j++)
        {

            min = sum[0] - m[j];
            if(min<0)
            {
                min = (min * -1);
            }
            closest = sum[0];
            for(i=1; i<l; i++)
            {
                tm = sum[i] - m[j];
                if(tm<0)
                {
                    tm = (tm * -1);
                }
                if( tm < min )
                {
                    min = tm;
                    closest = sum[i];
                }
            }
            printf("Closest sum to %d is %d.\n",m[j],closest);
        }
    }
    return 0;
}