#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
const int N=105;
const double eps=1e-8;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1; c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0'; c=getchar();}return x*f;
}
inline int sgn(double x){if(abs(x)<eps) return 0;else return x<0?-1:1;
}
struct Vector{int x,y;Vector(int a=0,int b=0):x(a),y(b){}
};
typedef Vector Point;
Vector operator +(Vector a,Vector b){return Vector(a.x+b.x,a.y+b.y);}
int Cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;
}int n,x,y,x2,y2,x3,y3,b,s;
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int main(int argc, const char * argv[]){while(scanf("%d",&x)!=EOF){y=read();x2=read();y2=read();x3=read();y3=read();if(!x&&!y&&!x2&&!y2&&!x3&&!y3) break;b=s=0;b=gcd(abs(x2-x),abs(y2-y))+gcd(abs(x3-x2),abs(y3-y2))+gcd(abs(x3-x),abs(y3-y));s=abs(Cross(Vector(x2-x,y2-y),Vector(x3-x,y3-y)));printf("%d\n",(s-b+2)/2);}return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
typedef long long ll;
const int N=105;
const double eps=1e-8;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1; c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0'; c=getchar();}return x*f;
}
inline int sgn(double x){if(abs(x)<eps) return 0;else return x<0?-1:1;
}
struct Vector{int x,y;Vector(int a=0,int b=0):x(a),y(b){}
};
typedef Vector Point;
Vector operator +(Vector a,Vector b){return Vector(a.x+b.x,a.y+b.y);}
int Cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;
}int n,x,y,b,s;
Point poly[N];
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int main(int argc, const char * argv[]){int T=read(),cas=0;while(T--){b=s=0;n=read();for(int i=1;i<=n;i++){x=read();y=read();b+=gcd(abs(x),abs(y));poly[i]=poly[i-1]+Point(x,y);s+=Cross(poly[i],poly[i-1]);}s=abs(s);printf("Scenario #%d:\n",++cas);printf("%d %d %.1f\n\n",(s+2-b)/2,b,0.5*s);}return 0;
}