// template version 1.11
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

// varibable settings {{{
#define infile "../test/sample-2.in"
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
// }}}

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
  #include "lib/dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}

template<typename T> struct BIT {/*{{{*/
  int n;
  vector<T> dat;

  BIT(int n=0){/*{{{*/
    initialize(n);
  }/*}}}*/

  void initialize(int nin){/*{{{*/
    n = nin;
    dat.resize(n);
    for(int i = 0; i<n; i++) dat[i] = 0;
  }/*}}}*/

  T sum(int i){/*{{{*/
    T s = 0;
    while(i >= 0){
      s += dat[i];
      i = (i & (i+1)) - 1;
    }
    return s;
  }/*}}}*/

  T sum_between(int i, int j){/*{{{*/
    if(i > j) return 0;
    return sum(j) - sum(i-1);
  }/*}}}*/

  void plus(int i, T x){/*{{{*/
    while(i < n){
      dat[i] += x;
      i |= i+1;
    }
  }/*}}}*/

  int lower_bound(T x){ // a[0]+...+a[ret] >= x{{{
    int ret = -1;
    int k = 1;
    while(2*k <= n) k <<= 1;
    for( ;k>0; k>>=1){
      if(ret+k < n && dat[ret+k] < x){
        x -= dat[ret+k];
        ret += k;
      }
    }
    return ret + 1;
  }/*}}}*/
};/*}}}*/

int solve(){
  int Q;cin>>Q;
  vector<int> A;
  vector<int> b(Q, 0);

  rep(q, Q){
    int t;cin>>t;
    if (t==1){  // update
      int a;cin>>a>>b[q];
      A.pb(a);
    }
    if (t==2){ // query
      A.pb(-INF);
    }
  }
  dump(A);
  dump(b);

  // zip: a = [3, 10, 5, 5, 2]
  vector<int> unzipper; // [2, 3, 5, 10]
  map<int, int> zipper; // {2:0, 3:2, 5:3, 10:4}
  vector<int> zipped; // [2, 4, 3, 3, 0]
  auto zip=[&](vector<int> a){ //{{{
    int n = sz(a);
    unzipper = vector<int>(n); zipped = vector<int>(n);
    rep(i, n) { unzipper[i]=a[i]; }
    uni(unzipper);
    rep(i, sz(unzipper)){ zipper[unzipper[i]] = i; }
    rep(i, n){ zipped[i] = zipper[a[i]]; }
    return 0;
  }; /// }}}
  zip(A);
  dump(unzipper); dump(zipper); dump(zipped);

  BIT<int> bit(sz(unzipper));
  BIT<int> bitsum(sz(unzipper));
  int acou = 0;
  int B = 0;
  rep(q, Q){
    if (A[q]==-INF){ // query
      int res = B;
      int mid =(acou+1)/2;
      int pos = bit.lower_bound(mid);
      dump(pos);
      res -= bitsum.sum(pos-1);
      res += bit.sum(pos-1) * unzipper[pos];

      res += bitsum.sum(sz(unzipper)-1) - bitsum.sum(pos);
      res -= (acou-bit.sum(pos)) * unzipper[pos];
      cout << unzipper[pos] << " " << res << endl;
    }
    else{
      B += b[q];
      bit.plus(zipper[A[q]], 1);
      bitsum.plus(zipper[A[q]], A[q]);
      acou++;
    }
    dump(bit.dat);
  }


  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 16724