#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)((x).size()))
//
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

template <typename T>
struct DynamicMedian {
  // size: q1 >= q2
  multiset<T> q1, q2;
  DynamicMedian() {}
  void move_l() {
    T tmp = *q2.begin();
    q2.erase(q2.begin());
    q1.emplace(tmp);
  }
  void move_r() {
    T tmp = *q1.rbegin();
    q1.erase(--q1.end());
    q2.emplace(tmp);
  }
  void add(T x) {
    if (q1.size() == q2.size()) {
      q2.emplace(x);
      move_l();
    } else {
      q1.emplace(x);
      move_r();
    }
  }
  bool del(T x) {
    bool f1 = q1.find(x) != q1.end();
    bool f2 = q2.find(x) != q2.end();
    if (f1)
      q1.erase(q1.find(x));
    else if (f2)
      q2.erase(q2.find(x));
    else
      return false;
    if (q1.size() == q2.size() + 2)
      move_r();
    else if (q1.size() + 1 == q2.size())
      move_l();
    return true;
  }
  // for even size
  // mode = 0: min
  // mode = 1: mean
  // mode = 2: max
  T median(int mode = 0) {
    assert(0 <= mode && mode <= 2);
    assert(q1.size());
    if (q1.size() == q2.size()) {
      switch(mode) {
      case 0:
        return *q1.rbegin();
      case 1:
        return (*q1.rbegin() + *q2.begin()) / 2;
      case 2:
        return *q2.begin();
      default:
        return -1;
      }
    } else {
      return *q1.rbegin();
    }
  }
};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  DynamicMedian<ll> dm;
  ll Q;
  cin >> Q;
  ll offset = 0;
  ll ans = 0;
  rep(qi, Q){
    ll t;
    cin >> t;
    if(t == 1){
      ll a, b;
      cin >> a >> b;
      if(SZ(dm.q1)){
        ll mi = dm.median(0);
        ll ma = dm.median(2);
        if(ma < a) ans += a - ma;
        if(a < mi) ans += mi - a;
      }
      dm.add(a);
      offset += b;
    }else{
      print(dm.median(0), ans + offset);
    }
  }
}


Measured memory_bytes: 9600