#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void f() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
queue<pair<int, int>> q;
int n, m, ai, aj;
bool vis[2005][2005] = {};
bool lev[2005][2005];
int h[] = {1, 0, 0, -1};
int v[] = {0, -1, 1, 0};
bool check(int i, int j) {
  if (i > 0 && i <= n && j > 0 && j <= m) {
    return 1;
  }
  return 0;
}
void dfs(int i, int j) {
  vis[i][j] = 1;
  for (int ii = 0; ii < 9; ii++) {
  }
}
void bfs() {
  while (!q.empty()) {
    int f = q.front().first, s = q.front().second;
    q.pop();
    vis[f][s] = 1;
    for (int ii = 0; ii < 4; ii++) {
      cout << check(f + h[ii], s + v[ii]);
      if (check(f + h[ii], s + v[ii]) && vis[f + h[ii]][s + v[ii]] == 0) {
        vis[f + h[ii]][s + v[ii]] = 1;
        q.push({f + h[ii], s + v[ii]});
        lev[f + h[ii]][s + v[ii]] = lev[f][s] + 1;
        ai = f + h[ii];
        aj = s + v[ii];
        cout << ai << " " << aj << endl;
      }
    }
  }
}
int main() {
  f();
  long long arr[300005] = {};
  for (int i = 1; i <= 3e5; i++) {
    arr[i] = arr[i - 1] ^ i;
  }
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    if (arr[n] == m)
      cout << n + 2;
    else if (arr[n - 1] == m) {
      cout << n;
    } else {
      cout << n + 1;
    }
    cout << endl;
  }
}
