#include using namespace std; typedef long long int LL; typedef unsigned long long int uLL; inline int _Int() { int x; scanf("%d",&x); return x; } LL bigMod(LL A,LL P,int M){ LL R=1; for(A%=M; P; P>>=1) { if(P&1) R=(R*A)%M; A=(A*A)%M; } return R; } /** (A^P) % M **/ LL bigMul(LL A,LL B,LL M) { LL R=0; for(A%=M; B; B>>=1) { if(B&1) R=(R+A)%M; A=(A+A)%M; } return R; } /** (A*B) % M **/ LL negMod(LL A,LL B) { return ( ( ( A % B ) + B) % B ); } /** (A % B) when A is negative or positive **/ uLL _pow(uLL A,int P) { uLL R=1; for(; P; P>>=1) { if(P&1) R=(R*A); A=(A*A); } return R; } /** (A^P) **/ templateT GCD(T x, T y) { while(x) x^=y^=x^=y%=x; return y; } /** GCD(a,b) **/ #define pi acos(-1) #define pb push_back #define endl '\n' /************************************************************************************************************************* ** Syed Zafrul Lipu (ShockProof) * ** CSE, University of Asia Pacific * **************************************************************************************************************************/ struct Point{ LL x,y; }; Point L[12]; bool inRng( LL left, LL mid, LL right ) { return left <= mid && mid <= right ; } void Main() { int n=_Int(); for(int i=0; i