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

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

ll a_left_sum = 0;
ll a_right_sum = 0;
priority_queue<ll> a_left, a_right;
ll a_left_size = 0;
ll a_right_size = 0;
ll a_ans = 0;
ll a_num = 0;

void update(ll a){
  a_left.push(a);
  a_left_sum += a;
  ll a_left_cand = a_left.top(); a_left.pop();
  a_left_sum -= a_left_cand;

  a_right.push(-a_left_cand);
  a_right_sum += a_left_cand;
  ll a_cand_right = -a_right.top(); a_right.pop();
  a_right_sum -= a_cand_right;

  if(a_num==0){
    a_ans = a;
  }else{
    if(a_left.size()==a_right.size()){
      ll a_cand = max(a_ans, a_cand_right);
      a_ans = min(a_ans, a_cand_right);
      a_right.push(-a_cand);
      a_right_sum += a_cand;
      a_right_size++;
    }else{
      ll a_cand = min(a_ans, a_cand_right);
      a_ans = max(a_ans, a_cand_right);
      a_left.push(a_cand);
      a_left_sum += a_cand;
      a_left_size++;
    }
  }

  return;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll b_sum = 0;

  ll Q;
  IN(Q);
  REP(q,Q){
    ll T;
    IN(T);
    if(T==1){
      ll a, b;
      IN(a,b);
      b_sum += b;
      update(a);
      a_num++;
    }else{
      if(a_num==0){
        printf("%lld %lld\n", 0, 0);
      }else{
        ll tmp = 0;
        tmp += b_sum;
        tmp += abs(a_ans*a_left_size-a_left_sum);
        tmp += abs(a_ans*a_right_size-a_right_sum);
        printf("%lld %lld\n", a_ans, tmp);
      }
    }
  }


  return 0;
}

Measured memory_bytes: 3828