/* * Avinash Gurjar(algebra1415011), Nit Silchar */ #include #define ll long long int using namespace std; #define loop(i,start,end) for (ll i=start;i<=end;i++) #define pool(i,start,end) for(ll i=start;i>=end;i--) #define algebra() ll t;scanf("%lld",&t);while(t--) #define vt(v) vector v; #define pb(n) push_back(n);` #define m_p(a,b) make_pair(a,b) #define fill(a,value) memset(a,value,sizeof(a)); #define vtp(vp) vector > vp; #define sci(n) scanf("%lld",&n); #define scii(x,y) scanf("%lld%lld", &x,&y); #define sciii(x,y,z) scanf("%lld%lld%lld", &x, &y, &z); #define scs(s) cin>>s; #define pr(n) printf("%lld",n); #define pnt() printf("hope"); #define gp() printf(" "); #define ln() printf("\n"); #define MOD 1000000007 #define PI 3.14159265358979323846 #define MAX_INT (ll)0x7fffffff #define MIN_INT (ll)0x80000000 #define MAX 1000008 #define debug() cout<<"######"<>qt; while(qt--) { ll nn; cin>>nn; ll arr[nn][2]; for(ll i=0;i>arr[i][0]>>arr[i][1]; ll x_min=INT_MAX,y_min=INT_MAX,x_max=INT_MIN,y_max=INT_MIN; for(ll i=0;i