#include<stdio.h>

 #include<string.h>

 //#include<iostream>

 #include<algorithm>

 using namespace std;

 #define LL long long

 int qread()

 {

     char c; int s=,t=; while ((c=getchar())<'' || c>'') (c=='-') && (t=-);

     do s=s*+c-''; while ((c=getchar())>='' && c<=''); return s*t;

 }

 //

 int tot;

 #define maxn 233333

 int a[maxn];

 struct Node

 {

     int x,y,v;

     bool operator < (const Node &b) const {return v<b.v;}

 }b[maxn]; int lb;

 int main()

 {

     int Max=,n=;

     a[]=; a[]=;

     b[++lb]=(Node){,,};

     for (n=;;n++)

     {

         if (n&) a[n]=a[n-]<<; else

         {

             for (int k=;k<=lb;k++) if (b[k].v!=b[k-].v+) {a[n]=b[k-].v+; break;}

             if (!a[n]) a[n]=b[lb].v+;

             a[n]+=a[n-];

         }

         for (int i=;i<n;i++) b[++lb]=(Node){n,i,a[n]-a[i]};

         sort(b+,b++lb);

         if (a[n]>Max) break;

     }

     int m=qread();

     while (m--)

     {

         int x=qread(),y;

         if (b[y=lower_bound(b+,b++lb,(Node){,,x})-b].v==x) printf("%d %d\n",b[y].x,b[y].y);

         else

         {

             int p=x-(y-);

             printf("%d %d\n",n+p*-,n+p*-);

         }

     }

     return ;

 }