#ifdef DEBUG_IS_VALID
#define DEB 1 
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif

#include <bits/stdc++.h>
using namespace std;

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#pragma GCC optimize ("-O3")

using namespace std;

#define DUMPOUT cout
#define dump(...) if(DEB) DUMPOUT<<"  "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<"    "; if(DEB) dump_func(__VA_ARGS__)
template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;}
template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; }
template<typename T>ostream& operator << (ostream& os, set<T>& st){cout << "{"; for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;}
template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; }

void dump_func(){DUMPOUT << endl;}
template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);}
template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;}
template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<Pl>;
using vvp = vector<vp>;

const int INF = 1<<29;
const long long LINF=1LL<<59;

int main(){
  // Failed to predict input format
  int Q;
  cin >> Q ;
  ll s1,s2,z;
  s1 = s2 = z = 0;
  priority_queue<ll> que1;
  priority_queue<ll,vector<ll>,greater<ll>> que2;
  ll med = -LINF;
  rep(i,Q){
    int q;
    cin >> q ;
    ll ma,mi,sz1,sz2;
    if(q==1){
      ll a,b; cin >> a >> b ;
      z += b;
      if(med==-LINF){
        med = a;
      }else if(a<med){
        que1.push(a); s1 += a;
      }else{
        que2.push(a); s2 += a;
      }
      if(que1.size()>que2.size()){
        while(ll(que1.size())-ll(que2.size())>0){
          // que1 -> que2
          ll ma = que1.top();
          que1.pop(); s1 -= ma;
          que2.push(med); s2 += med;
          med = ma;
        }
      }else if(ll(que1.size())-ll(que2.size())<-1){
        while(ll(que1.size())-ll(que2.size())<-1){
          // que2 -> que1
          ll mi = que2.top();
          que2.pop(); s2 -= mi;
          que1.push(med); s1 += med;
          med = mi;
        }
      }
      // if(sz1==0){
      //   que1.push(a);
      //   s1 += a;
      // }else if(sz1==sz2){
      //   if(a<=ma){
      //     que1.push(a);
      //     s1 += a;
      //   }else{
      //     que2.pop();
      //     s2 -= mi;
      //     que2.push(a);
      //     s2 += a;
      //     que1.push(mi);
      //     s1 += mi;
      //   }
      // }else{
      //   if(a<=ma){
      //     que1.pop();
      //     s1 -= ma;
      //     que1.push(a);
      //     s1 += a;
      //     que2.push(ma);
      //     s2 += ma;
      //   }else{
      //    que2.push(a);
      //    s2 += a; 
      //   }
      // }
      dump(s1,s2,que1.size(),que2.size());
    }else{
      cout << med << " " << ll(que1.size())*med-s1+s2-ll(que2.size())*med+z << endl;
    }
  }
  return 0;
}

Measured memory_bytes: 3828