#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
namespace IO {
const int BUFFER_SIZE = 1 << 15;
char input_buffer[BUFFER_SIZE];
int input_pos = 0, input_len = 0;
char output_buffer[BUFFER_SIZE];
int output_pos = 0;
char number_buffer[100];
uint8_t lookup[100];
void _update_input_buffer() {
  input_len = fread(input_buffer, sizeof(char), BUFFER_SIZE, stdin);
  input_pos = 0;
  if (input_len == 0) input_buffer[0] = EOF;
}
inline char next_char(bool advance = true) {
  if (input_pos >= input_len) _update_input_buffer();
  return input_buffer[advance ? input_pos++ : input_pos];
}
template <typename T>
inline void read_int(T &number) {
  bool negative = false;
  number = 0;
  while (!isdigit(next_char(false)))
    if (next_char() == '-') negative = true;
  do {
    number = 10 * number + (next_char() - '0');
  } while (isdigit(next_char(false)));
  if (negative) number = -number;
}
template <typename T, typename... Args>
inline void read_int(T &number, Args &...args) {
  read_int(number);
  read_int(args...);
}
void _flush_output() {
  fwrite(output_buffer, sizeof(char), output_pos, stdout);
  output_pos = 0;
}
inline void write_char(char c) {
  if (output_pos == BUFFER_SIZE) _flush_output();
  output_buffer[output_pos++] = c;
}
template <typename T>
inline void write_int(T number, char after = '\0') {
  if (number < 0) {
    write_char('-');
    number = -number;
  }
  int length = 0;
  while (number >= 10) {
    uint8_t lookup_value = lookup[number % 100];
    number /= 100;
    number_buffer[length++] = (lookup_value & 15) + '0';
    number_buffer[length++] = (lookup_value >> 4) + '0';
  }
  if (number != 0 || length == 0) write_char(number + '0');
  for (int i = length - 1; i >= 0; i--) write_char(number_buffer[i]);
  if (after) write_char(after);
}
void init() {
  bool exit_success = atexit(_flush_output) == 0;
  assert(exit_success);
  for (int i = 0; i < 100; i++) lookup[i] = (i / 10 << 4) + i % 10;
}
}  // namespace IO
const int NQ_MAX = 5e5 + 5;
const int BITS = 20;
struct query {
  int L, R, index;
};
int N, Q;
int burgers[NQ_MAX], answers[NQ_MAX];
vector<query> queries_at_start[NQ_MAX];
int basis[BITS], basis_index[BITS];
int main() {
  IO::init();
  IO::read_int(N);
  for (int i = 0; i < N; i++) IO::read_int(burgers[i]);
  IO::read_int(Q);
  for (int i = 0; i < Q; i++) {
    query q;
    IO::read_int(q.L, q.R);
    q.L--;
    q.index = i;
    queries_at_start[q.L].push_back(q);
  }
  for (int start = N - 1; start >= 0; start--) {
    int x = burgers[start], index = start;
    for (int bit = BITS - 1; bit >= 0; bit--)
      if (x >> bit & 1) {
        if (basis[bit] == 0) {
          basis[bit] = x;
          basis_index[bit] = index;
          break;
        }
        if (index < basis_index[bit]) {
          swap(x, basis[bit]);
          swap(index, basis_index[bit]);
        }
        x ^= basis[bit];
      }
    for (query &q : queries_at_start[start]) {
      int answer = 0;
      for (int bit = BITS - 1; bit >= 0; bit--)
        if (basis_index[bit] < q.R) answer = max(answer, answer ^ basis[bit]);
      answers[q.index] = answer;
    }
  }
  for (int i = 0; i < Q; i++) IO::write_int(answers[i], '\n');
}
