#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cctype>

#include <algorithm>
#include <random>
#include <bitset>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <vector>
#include <chrono>
#include <iostream>
#include <limits>
#include <numeric>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<class T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &x : v)
    is >> x;
  return is;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  if (!v.empty()) {
    os << v.front();
    for (int i = 1; i < v.size(); ++i)
      os << ' ' << v[i];
  }
  return os;
}

typedef pair<ll, int> pii;

bool cmp(const pii& lhs, const pii& rhs) {
  if (lhs.first > rhs.first) return false;
  if (lhs.first < rhs.first) return true;
  if (abs(lhs.second) < abs(rhs.second)) return false;
  if (abs(lhs.second) > abs(rhs.second)) return true;
  return lhs.first < rhs.first;
}

int main() {
#ifdef ELEGIA
  freopen("test.in", "r", stdin);
  int nol_cl = clock();
#endif
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  cin >> n;
  vector<pair<int, int>> disc;
  disc.emplace_back(-1e9 - 10, 0);
  disc.emplace_back(1e9 + 10, 0);
  while (n--) {
    int t;
    cin >> t;
    if (t == 1) {
      int l, r, x;
      cin >> l >> r >> x;
      disc.emplace_back(l, x);
      disc.emplace_back(r + 1, x);
    } else {
      int p, x;
      cin >> p >> x;
      disc.emplace_back(p, x);
      disc.emplace_back(p + 1, x);
      if (t == 3)
        disc[0].second ^= x;
    }
  }
  sort(disc.begin(), disc.end());
  pii ans(-1, 0);
  int xsum = 0;
  for (int i = 0; i + 1 < disc.size(); ++i) {
    xsum ^= disc[i].second;
    if (disc[i].first < disc[i + 1].first) {
      pii cur(xsum, disc[i].first);
      cur = max(cur, pii(xsum, disc[i + 1].first - 1), cmp);
      if (disc[i].first <= 0 && disc[i + 1].first > 0)
        cur.second = 0;
      ans = max(ans, cur, cmp);
    }
  };
  cout << ans.first << ' ' << ans.second << '\n';

#ifdef ELEGIA
  LOG("Time: %dms\n", int ((clock()
          -nol_cl) / (double)CLOCKS_PER_SEC * 1000));
#endif
  return 0;
}