// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

struct qu{
  int c;
  ll a, b;
  qu(){

  }
  qu(int c, ll a=0, ll b=0): c(c), a(a), b(b){}
};

template<typename T>
struct BIT_{
  int n;
  vector<T> bit;
  BIT_(int n_){
    n = n_;
    bit = vector<T>(n+1, 0);
  }
  void add(int a, T w){
    for(int x = a; x < n; x |= (x + 1)){
      bit[x] += w;
    }
  }
  T sum(int a){
    T res = 0;
    for(int x = a; x >= 0; x = (x & (x + 1)) - 1){
      res += bit[x];
    }
    return res;
  }
};

typedef struct BIT_<int> BITI;
typedef struct BIT_<long long> BITL;

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  INT(q);
  vector<qu> v(q);
  vector<ll> m;
  ll b = 0;
  rep(i, q){
    cin >> v[i].c;
    if(v[i].c == 1){
      cin >> v[i].a >> v[i].b;
      v[i].a *= 2;
      v[i].b *= 2;
      m.pb(v[i].a);
    }
  }
  sort(all(m));
  vector<int> ind(q);
  map<ll, int> mp;
  rep(i, sz(m)){
    if(mp.find(m[i]) == mp.end())mp[m[i]] = i;
  }
  rep(i, q){
    if(v[i].c == 1){
      ind[i] = mp[v[i].a];
      mp[v[i].a]++;
    }
  }
  BITI bt(sz(m));
  BITL btl(sz(m));
  ll s = 0;
  rep(i, q){
    if(v[i].c == 1){
      bt.add(ind[i], 1);
      btl.add(ind[i], v[i].a);
      b += v[i].b;
      s++;
    }else{
      if(s % 2 == 1){
        int t = s / 2 + 1;
        int l = -1, r = sz(m) - 1;
        while(r - l > 1){
          int md = (r + l) / 2;
          int tmp = bt.sum(md);
          if(tmp >= t)r = md;
          else l = md;
        }
        l = r;
        ll res = b;
        res += btl.sum(sz(m) - 1) - btl.sum(l) - s / 2 * m[l];
        res += s / 2 * m[l] - btl.sum(l - 1);
        cout << m[l] / 2 << " " << res / 2 << endl;
      }else{
        int t = s / 2;
        int l = -1, r = sz(m) - 1;
        while(r - l > 1){
          int md = (r + l) / 2;
          int tmp = bt.sum(md);
          if(tmp >= t)r = md;
          else l = md;
        }
        l = r;

        ll res = b;
        res += btl.sum(sz(m) - 1) - btl.sum(l) - s / 2 * m[l];
        res += s / 2 * m[l] - btl.sum(l);
        cout << m[l] / 2 << " " << res / 2 << endl;
      }
    }
  }
  return 0;
}



Measured memory_bytes: 16244