#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


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 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< class T >
struct BinaryIndexedTree {
  vector< T > data;

  BinaryIndexedTree(int sz) {
    data.assign(++sz, 0);
  }

  T sum(int k) {
    T ret = 0;
    for(++k; k > 0; k -= k & -k) ret += data[k];
    return (ret);
  }

  void add(int k, T x) {
    for(++k; k < data.size(); k += k & -k) data[k] += x;
  }
};

template< class T >
struct AdditionalBIT : BinaryIndexedTree< T > {
  int curr;

  AdditionalBIT(int sz) : BinaryIndexedTree< T >(sz) {
    curr = 1;
    while(curr <= sz) curr <<= 1;
  }

  int lower_bound(T w) {
    if(w <= 0) return (0);
    int i = 0;
    for(int k = curr; k > 0; k >>= 1) {
      if(i + k < BinaryIndexedTree< T >::data.size() && BinaryIndexedTree< T >::data[i + k] < w) {
        w -= BinaryIndexedTree< T >::data[i + k];
        i += k;
      }
    }
    return (i);
  }
};

int main() {
  int Q;
  cin >> Q;
  vector< int > A(Q), B(Q), C(Q);
  vector< int > xs;
  for(int i = 0; i < Q; i++) {
    cin >> A[i];
    if(A[i] == 1) {
      cin >> B[i] >> C[i];
      xs.emplace_back(B[i]);
    }
  }
  sort(begin(xs), end(xs));
  xs.erase(unique(begin(xs), end(xs)), end(xs));
  AdditionalBIT< int64 > bit1(xs.size()), bit2(xs.size());
  int64 pt = 0, add = 0;
  for(int i = 0; i < Q; i++) {
    if(A[i] == 1) {
      auto it = lower_bound(begin(xs), end(xs), B[i]) - begin(xs);
      bit1.add(it, 1);
      bit2.add(it, xs[it]);
      add += C[i];
      pt += 1;
    } else {
      int p = bit1.lower_bound((pt - 1) / 2 + 1);
      /*
      int64 uku = 0;
      for(int j = 0; j < xs.size(); j++) {
        int v = bit1.sum(j) - bit1.sum(j - 1);
        if(j > p) {
          uku += (xs[j] - xs[p]) * v;
        } else {
          uku += (xs[p] - xs[j]) * v;
        }
      }
       */
      int64 uku = 0;
      uku += bit2.sum(xs.size() - 1) - bit2.sum(p);
      uku -= (bit1.sum(xs.size() - 1) - bit1.sum(p)) * xs[p];
      uku -= bit2.sum(p);
      uku += (bit1.sum(p)) * xs[p];
      cout << xs[p] << " " << uku + add << endl;
    }
  }
}

Measured memory_bytes: 7032