#include<cmath>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

const int N = ;

struct Point

{

    ll x,y;

    Point(){}

    Point(ll x,ll y):x(x),y(y){}

    Point operator + (const Point&a)const{return Point(x+a.x,y+a.y);}

    Point operator - (const Point&a)const{return Point(x-a.x,y-a.y);}

    ll operator ^ (const Point&a)const{return x*a.y-y*a.x;}

};

typedef Point Vector;

int T,n;

Point p[N];

ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}

void work(int Sce)

{

    scanf("%d",&n);

    ll S = ,b = ;

    Point s0(,),s1(,),s2(,);

    Vector v;

    for(int i=;i<=n;i++)

    {

        scanf("%I64d%I64d",&v.x,&v.y);

        ll x = v.x,y = v.y;

        if(x<)x=-x;

        if(y<)y=-y;

        b += gcd(x,y);

        s1 = s2,s2 = s2 + v;

        S += ((s1-s0)^(s2-s0));

    }

    if(S<)S=-S;

    ll a = (S+-b)/;

    printf("Scenario #%d:\n",Sce);

    printf("%I64d %I64d ",a,b);

    if(S&)printf("%I64d.5\n\n",S/);

    else printf("%I64d.0\n\n",S/);

}

int main()

{

    scanf("%d",&T);

    for(int i=;i<=T;i++)work(i);

    return ;

}