HDU 5734 Acperience

/* ***********************************************
Author        :angon
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define mst(a,k)  memset(a,k,sizeof(a));
#define LL long long
#define maxn 1005
#define mod 100000007


LL gcd(LL n, LL m)
{
    return m?gcd(m,n%m):n;
}
LL a[100000 + 10];
int main()
{
    freopen("1001in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    int t,n;
    scan(t);
    while(t--)
    {
        scan(n);
        LL c=0;
        LL b=0;
        REP(i,0,n)
        {
            scanf("%I64d",&a[i]);
            if(a[i]<0) a[i]*=-1;
            b += a[i];
            c += a[i]*a[i];
        }
        LL fz = n*c - b*b;
        LL k=gcd(fz,n);
        printf("%I64d/%I64d\n",fz/k,n/k);
    }


    return 0;
}