description: Gregor is learning about RSA cryptography, and although he doesn't understand how RSA works, he is now fascinated with prime numbers and factoring them.
  
  Gregor's favorite prime number is P. Gregor wants to find two bases of P. Formally, Gregor is looking for two integers a and b which satisfy both of the following properties.
  
    * P mod a = P mod b, where x mod y denotes the remainder when x is divided by y, and 
    * 2 ≤ a < b ≤ P. 
  
  
  
  Help Gregor find two bases of his favorite prime number!
  
  Input
  
  Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 1000).
  
  Each subsequent line contains the integer P (5 ≤ P ≤ {10}^9), with P guaranteed to be prime.
  
  Output
  
  Your output should consist of t lines. Each line should consist of two integers a and b (2 ≤ a < b ≤ P). If there are multiple possible solutions, print any.
  
  Example
  
  Input
  
  
  2
  17
  5
  
  
  Output
  
  
  3 5
  2 4
  
  Note
  
  The first query is P=17. a=3 and b=5 are valid bases in this case, because 17 mod 3 = 17 mod 5 = 2. There are other pairs which work as well.
  
  In the second query, with P=5, the only solution is a=2 and b=4.
solution: import java.io.*;
  import java.util.*;
  
   // Author : Yash Shah
  
  public class A implements Runnable {
  
      public void run() {
         	
          InputReader sc = new InputReader(System.in);
          PrintWriter out = new PrintWriter(System.out);
  
          int t = sc.nextInt();
         
          while(t--!=0) {
  
              int n = sc.nextInt();
              int x = n-1;
              int y = 2;
              out.println(y+" "+x); 
          }
         
          out.close();
      }
   
  //========================================================================
  
  
      static void sa(int a[],InputReader sc)
  	{
  		for(int i=0;i<a.length;i++)
  		{
  			a[i]=sc.nextInt();
  		}
          // Arrays.sort(a);
  	}
  
  	static class pair<U extends Comparable<U>, V extends Comparable<V>> implements Comparable<pair<U, V>> {
          public U x;
          public V y;
  
          public pair(U x, V y) {
              this.x = x;
              this.y = y;
          }
  
          public int compareTo(pair<U, V> other) {
              int i = x.compareTo(other.x);
              if (i != 0) return i;
              return y.compareTo(other.y);
          }
  
          public String toString() {
              return x.toString() + " " + y.toString();
          }
  
          public boolean equals(Object obj) {
              if (this.getClass() != obj.getClass()) return false;
              pair<U, V> other = (pair<U, V>) obj;
              return x.equals(other.x) && y.equals(other.y);
          }
  
          public int hashCode() {
              return 31 * x.hashCode() + y.hashCode();
          }
  
      }
  
  
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
          private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
   
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
         
          public int read() {
              if (numChars==-1)
                  throw new InputMismatchException();
             
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  }
                  catch (IOException e) {
                      throw new InputMismatchException();
                  }
                 
                  if(numChars <= 0)              
                      return -1;
              }
              return buf[curChar++];
          }
       
          public String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
          public int nextInt() {
              int c = read();
             
              while(isSpaceChar(c))
                  c = read();
             
              int sgn = 1;
             
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
             
              int res = 0;
              do {
                  if(c<'0'||c>'9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
             
              return res * sgn;
          }
         
          public long nextLong() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
             
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              while (!isSpaceChar(c));
                  return res * sgn;
          }
         
          public double nextDouble() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E')
                      return res * Math.pow(10, nextInt());
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E')
                          return res * Math.pow(10, nextInt());
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
         
          public String readString() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              }
              while (!isSpaceChar(c));
             
              return res.toString();
          }
       
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
       
          public String next() {
              return readString();
          }
         
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  
      public static void main(String args[]) throws Exception {
          new Thread(null, new A(),"Main",1<<27).start();
      }
  }