#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
  template<class T> void ResizeVec(T&, vector<int>) {}
  template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
    vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
    for (T& v : vec) { ResizeVec(v, sz); }
  }
  typedef Triple<int, int, int> TIII;
  template<class A, class B, class C>
  ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
  template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  
  VPII lamps;
  //int C;
  // VI Xor(VI L, VI R) {
  //   REP (tr, SZ(L)) {
  //     L[tr] ^= R[tr];
  //   }
  //   return L;
  // }
  int Shift(int heh, int shift) {
    if (heh == 7) { return heh; }
    if (heh == 0) { return heh; }
    shift %= 3;
    heh *= (1 << shift);
    return heh % 7;
    //   VI dupa(SZ(heh));
    //   REP (i, SZ(heh)) {
    //     dupa[(i + shift) % SZ(heh)] = heh[i];
    //   }
    //   return dupa;
  }
  int CountLamps1(int kInf, int e, int x, int y) {
    //debug(kInf, e, x, y);
    int d = kInf - x - y;
    if (e < y) {
      return 0; //{0, 0, 0};
    }
    VI bits;
    REP (bit, 60) {
      if (d & (1ll << bit)) {
        bits.PB(1);
      } else {
        bits.PB(0);
      }
    }
    vector<int> prefs{1};
    //prefs.PB({1, 0, 0});
    REP (bit, 60) {
      if (!bits[bit]) {
        prefs.PB(prefs.back());
      } else if (bit % 2) {
        prefs.PB(prefs.back() ^ Shift(prefs.back(), 2));
      } else {
        prefs.PB(prefs.back() ^ Shift(prefs.back(), 1));
      }
    }
    int maxY = kInf - x;
    if (e >= maxY) {  return Shift(prefs.back(), (y % 3 + 3) % 3); }
    int shift = 0;
    int how_many = e - y + 1;
    //debug(how_many);
    int so_far = 0;;
    FORD (bit, 59, 0) {
      if (how_many & (1ll << bit)) {
        //debug(prefs[bit], shift % 3);
        so_far = so_far ^ Shift(prefs[bit], shift);
        
        if (bits[bit]) {
          shift += (1ll << bit);
          shift %= 3;
        } else {
          break;
        }
      }
    }
    //debug(so_far);
    return Shift(so_far, (y % 3 + 3) % 3);
  }
  int CountLampsAll(int kInf, int e) {
    int hehs = 0;
    for (auto lamp : lamps) {
      int lul = CountLamps1(kInf, e, lamp.st, lamp.nd);
      hehs = hehs ^ lul;
    }
    return hehs;
  }
  int CountLampsAll(int kInf, int b, int e) {
    return CountLampsAll(kInf, e) ^ CountLampsAll(kInf, b - 1);
  }
  int IsLit(int x, int y) {
    int heh = 0;
    for (auto lamp : lamps) {
      int d = x + y - lamp.st - lamp.nd;
      if (lamp.nd > y) { continue; }
      if (lamp.st > x) { continue; }
      int ind = y - lamp.nd;
      if ((ind & d) == ind) {
        heh ^= 1;
      }
    }
    return heh;
  }
  int32_t main() {
    
    ios_base::sync_with_stdio(0);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
    cin.tie(0);
    //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
    
    //   kInf = 1;
    //   debug(CountLamps1(1, 0, 0));
    //kInf = 5;
    //debug(CountLamps1(5, 0, 0));
    //debug(CountLamps1(4, 0, 0));
    //   debug(CountLamps1(3, 0, 0));
    //   kInf = 6;
    //   debug(CountLamps1(6, 0, 0));
    //   debug(CountLamps1(5, 0, 0));
    //   debug(CountLamps1(4, 0, 0));
    
    
    
    
    const int kInf = 4e17;
    
    int n;
    cin>>n;
    RE (i, n) {
      int x, y;
      cin>>x>>y;
      //maxi(C, x + y);
      lamps.PB({x, y});
    }
//     int hehs = CountLampsAll(kInf, kInf);
//     if (hehs == 0) { cout<<"DUPA"<<endl; return 0; }
    //   int r;
    //   REP (tr, 3) {
    //     if (hehs & (1 << bit)) { r = tr; }
    //   }
    int kl = -kInf, kp = 2 * kInf;
    //VI zeros{0, 0, 0};
    //assert(CountLampsAll(kInf, kl, kp) != zeros);
    while (kl != kp) {
      if (kl == kp) { break; }
      int aktc = (kl + kp) >> 1;
      //assert(CountLampsAll(kInf, kl, kp) == Xor(CountLampsAll(kInf, kl, aktc), CountLampsAll(kInf, aktc + 1, kp)));
      if (CountLampsAll(kInf, kl, aktc)) {
        kp = aktc;
      } else {
        kl = aktc + 1;
      }
    }
    //debug(CountLampsAll(kInf, kl, kl), kl, kl % 3);
    assert(IsLit(kInf - kl, kl));
    int L = kl, R = kl;
    FORD (bit, 60, 0) {
      int candL = L - (1ll << bit);
      //debug(L & (1ll << bit), bit); 
      if (IsLit(kInf - candL, candL)) {
        //debug("dol");
        L = candL;
      }
      int candR = R + (1ll << bit);
      if (IsLit(kInf - candR, candR)) {
        R = candR;
      }
    }
    // R to maxy, L to miny
    int X = kInf - R;
    int Y = L;
    cout<<X<<" "<<Y<<endl;
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    return 0;
  }
  

Measured memory_bytes: 640