#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

//using ll = long long;
using ll = __int128_t;

class BIT{
public:
  typedef long long ll;
  ll n;
  unordered_map<Int, ll> bit0, bit1;
  BIT(){n=-1;}
  BIT(ll n_){
    n=1;
    while(n<n_)n*=2;
  }
  
  ll sum(unordered_map<ll, ll> &b,ll i){
    ll s=0;
    while(i>0){
      s = (s + b[i]);// % mod;
      i -= i & -i;
    }
    return s;
  }

  void add(unordered_map<ll, ll> &b,ll i,ll v){
    // v = (mod + v % mod) % mod;
    while(i<=n){
      ll &x = b[i];
      x = (x + v);//% mod;
      i += i & -i;
    }
  }
  
  //[a,b)にxを加算 0オリジン
  void add (ll a,ll b,ll x){
    // x = (mod + x % mod) % mod;
    if(a == b) return;
    a++;
    assert(a <= b && 1 <= a && b <= n);
    add(bit0, a, -x*(a-1));
    add(bit1, a, x);
    add(bit0, b+1, x*b);
    add(bit1, b+1, -x);
  }

  //[a,b)のsumを得る 0オリジン
  ll sum(ll a,ll b){
    if(a == b) return 0;
    a++;
    assert(a <= b && 1 <= a && b <= n);
    ll s = sum(bit0,b);
    ll t = sum(bit1,b) * b;
    ll u = sum(bit0,a-1);
    ll v = sum(bit1,a-1) * (a-1);
    return s + t - u - v;
    //return ((s + t) + (mod - u%mod) + (mod - v%mod)) % mod;
  }
};



signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int q;
  cin>>q;

  Int LENGTH = 2e9;
  BIT bitL(LENGTH), bitR(LENGTH);
  Int ofset = 0;
  priority_queue<Int, vector<Int>, greater<Int>> LQ, RQ;
  priority_queue<Int> lq, rq;

  //LQ.push(0);
  //RQ.push(0);
  lq.push(0);
  rq.push(0);

  auto calcL =[&](BIT &bit){
    return LQ.top();
    Int L = 1, R = LENGTH;
    while(L + 1 < R){
      Int M = (L + R) / 2;
      bit.sum(M, M + 1) >= 0? (L = M):(R = M);
    };
    
    assert(L == LQ.top());
    return L;
  };
  
  auto calcR =[&](BIT &bit){
    return rq.top();
    Int L = 1, R = LENGTH;
    while(L + 1 < R){
      Int M = (L + R) / 2;
      bit.sum(M, M + 1) > 0? (L = M):(R = M);
    }
    assert(L == rq.top());
    return L;
  };

  auto updateL = [&](){
    auto &Q = LQ;
    auto &q = lq;
    while(Q.size() > q.size()){
      q.push(Q.top()), Q.pop();
    }

    while(Q.size() && q.size() && Q.top() < q.top()){
      Int a = Q.top(); Q.pop();
      Int b = q.top(); q.pop();
      Q.push(b);
      q.push(a);
    }
  };
  
  auto updateR = [&](){
    auto &Q = RQ;
    auto &q = rq;
    
    while(Q.size() >= q.size()){
      //pr(Q.size(), q.size());
      q.push(Q.top()), Q.pop();

    }

    while(Q.size() && q.size() && Q.top() < q.top()){
      Int a = Q.top(); Q.pop();
      Int b = q.top(); q.pop();
      Q.push(b);
      q.push(a);
    }
  };

  Int cntL = 0, cntR = 0;
  Int addL = 0, addR = 0;
  while(q--){
    Int cmd;
    cin>>cmd;
    if(cmd == 1){
      Int a, b;
      cin>>a>>b;
      ofset += abs(a) + b;
      if(a < 0){
	bitL.add(1, abs(a)+1, 2);
	addL--; //bitL.add(abs(a)+1, LENGTH, -1);
	addR--; //bitR.add(1, LENGTH, -1);


	LQ.push(abs(a));
	RQ.push(0);
	
	cntL++;
	cntR--;
      }
      else if(a > 0){
	bitR.add(1, abs(a)+1, 2);
	addR--;	//bitR.add(abs(a)+1, LENGTH, -1);
	addL--; //bitL.add(1, LENGTH, -1);

	RQ.push(abs(a));
	LQ.push(0);
	
	
	cntR++;
	cntL--;
      }
      else{
	addL--; //bitL.add(1, LENGTH, -1);
	addR--; //bitR.add(1, LENGTH, -1);

	RQ.push(0);
	LQ.push(0);
	
	
	cntL--;
	cntR--;
      }
    }
    else{
      
      if(addL) bitL.add(1, LENGTH, addL), addL = 0;
      if(addR) bitR.add(1, LENGTH, addR), addR = 0;
      updateL();
      updateR();
      
      Int ans = ofset;
      Int x = 0;
      
      if(cntL >= 0) {
	x = calcL(bitL);
	ans = ofset - bitL.sum(1, x+1);
	x *= -1;
      }
      else if(cntR > 0) {
	x = calcR(bitR);
	ans = ofset - bitR.sum(1, x+1);
      }

      if(ofset < ans) ans = ofset, x = 0;
      cout<<x<<" "<<ans<<endl;
      
    }
  }
  

      
  
  return 0;
}


Measured memory_bytes: 68816