#include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 2147483647

 #define maxn 250000

 #define maxm 500+100

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define mod 1000000007

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}

     return x*f;

 }

 int n,s[maxn],t[maxn],d[maxn];

 int calc(int x)

 {

     int ret=;

     for1(i,n)if(s[i]<=x)ret+=(min(x,t[i])-s[i])/d[i]+;

     return ret;

 }

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);

     int cs=read();

     while(cs--)

     {

         n=read();

         for1(i,n)s[i]=read(),t[i]=read(),d[i]=read();

         ll l=,r=inf,mid;

         while(l<=r)

         {

             mid=(l+r)>>;

             if(calc(mid)&)r=mid-;else l=mid+;

                 //cout<<l<<' '<<r<<' '<<mid<<endl;

             //cout<<( calc(mid)&1 )<<endl;

         }

         if(r==inf)printf("Poor QIN Teng:(\n");else printf("%lld %d\n",l,calc(l)-calc(l-));

     }

     return ;

 }