description: Alice gave Bob two integers a and b (a > 0 and b ≥ 0). Being a curious boy, Bob wrote down an array of non-negative integers with \operatorname{MEX} value of all elements equal to a and \operatorname{XOR} value of all elements equal to b.
  
  What is the shortest possible length of the array Bob wrote?
  
  Recall that the \operatorname{MEX} (Minimum EXcluded) of an array is the minimum non-negative integer that does not belong to the array and the \operatorname{XOR} of an array is the [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all the elements of the array.
  
  Input
  
  The input consists of multiple test cases. The first line contains an integer t (1 ≤ t ≤ 5 ⋅ 10^4) — the number of test cases. The description of the test cases follows.
  
  The only line of each test case contains two integers a and b (1 ≤ a ≤ 3 ⋅ 10^5; 0 ≤ b ≤ 3 ⋅ 10^5) — the \operatorname{MEX} and \operatorname{XOR} of the array, respectively.
  
  Output
  
  For each test case, output one (positive) integer — the length of the shortest array with \operatorname{MEX} a and \operatorname{XOR} b. We can show that such an array always exists.
  
  Example
  
  Input
  
  
  5
  1 1
  2 1
  2 0
  1 10000
  2 10000
  
  
  Output
  
  
  3
  2
  3
  2
  3
  
  Note
  
  In the first test case, one of the shortest arrays with \operatorname{MEX} 1 and \operatorname{XOR} 1 is [0, 2020, 2021].
  
  In the second test case, one of the shortest arrays with \operatorname{MEX} 2 and \operatorname{XOR} 1 is [0, 1].
  
  It can be shown that these arrays are the shortest arrays possible.
solution: //package MyPackage;
  import java.io.*;
  import java.util.*;
  public class MyClass {
      final static long mod = 1_000_000_007;
      final static int mini = Integer.MIN_VALUE;
      final static int maxi = Integer.MAX_VALUE;
      static long gcd(long a, long b) {
          if (b == 0) return a;
          return gcd(b, a % b);
      }
      static long ncr(long n, long r) {
          if (r > n - r) r = n - r;
          long[] C = new long[(int) r + 1];
          C[0] = 1;
          for (int i = 1; i <= n; i++) {
              for (long j = Math.min(i, r); j > 0; j--)
                  C[(int) j] = (C[(int) j] + C[(int) j - 1]) % mod;
          }
          return C[(int) r];
      }
      static boolean isPrime(long n) {
          if (n <= 1)
              return false;
          else if (n == 2)
              return true;
          else if (n % 2 == 0)
              return false;
          for (int i = 3; i <= Math.sqrt(n); i += 2) {
              if (n % i == 0)
                  return false;
          }
          return true;
      }
      static boolean isPalindrome(String s, int k) {
          int i = 0, j = s.length() - 1;
          while(i < k) {
              if(s.charAt(i) != s.charAt(j)) return false;
              i++;
              j--;
          }
          return true;
      }
      static long lcm(long a, long b) {
          return (a / gcd(a, b)) * b;
      }
      static void sort(long[] a) {
          ArrayList<Long> l = new ArrayList<>();
          for (long value : a) {
              l.add(value);
          }
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a[i] = l.get(i);
      }
      static int ceil(int a, int b) {
          return a % b == 0 ? a / b : a / b + 1;
      }
      static void sort(int[] a) {
          ArrayList<Integer> l = new ArrayList<>();
          for (int value : a) {
              l.add(value);
          }
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a[i] = l.get(i);
      }
      static void reverse(int[] arr) {
          int l = 0;
          int h = arr.length - 1;
          while (l < h) {
              swap(arr, l, h);
              l++;
              h--;
          }
      }
      static String reverse(String s) {
          StringBuilder res = new StringBuilder(s);
          return res.reverse().toString();
      }
      static void swap(int[] arr, int i, int j) {
          int temp = arr[i];
          arr[i] = arr[j];
          arr[j] = temp;
      }
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String n() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nint() {
              return Integer.parseInt(n());
          }
  
          long nlong() {
              return Long.parseLong(n());
          }
  
          double ndouble() {
              return Double.parseDouble(n());
          }
  
          int[] narr(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nint();
              return a;
          }
          int[][] narr(int n, int m) {
              int[][] a = new int[n][m];
              for (int i = 0; i < n; i++)
                  for (int j = 0; j < m; j++)
                      a[i][j] = nint();
              return a;
          }
  
          String nline() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      public static void main(String[] args) {
          FastReader sc = new FastReader();
          PrintWriter out = new PrintWriter(System.out);
          // int t = 1;
          int t = sc.nint();
          while(t-- > 0) {
              int a = sc.nint();
              int b = sc.nint();
              int res = xor(a - 1);
              if(res == b) out.println(a);
              else if((res ^ b) != a) out.println(a + 1);
              else out.println(a + 2);
          }
          out.flush();
          out.close();
      }
      static int xor(int n) {
          if (n % 4 == 0) return n;
          if (n % 4 == 1) return 1;
          if (n % 4 == 2) return n + 1;
          return 0;
      }
  }