#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647;
const long long int llINF = 9223372036854775807;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
struct multi {
  ll first;
  ll second;
  ll third;
  multi(ll first, ll second, ll third)
      : first(first), second(second), third(third) {}
};
bool multicomp(const multi &a, const multi &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll Q;
  cin >> Q;
  ll B = 0;
  priority_queue<ll> A1;
  PQ(ll) A2;
  vector<pll> ANS;
  ll A = 0;
  ll right = 0, left = 0;
  REP(i, Q) {
    ll q = 0;
    ll a = 0, b = 0;
    cin >> q;
    if (q == 1) {
      cin >> a >> b;
      B += b;
      if (A1.size() == 0 || a < A1.top()) {
        A1.push(a);
        left += a;
      } else {
        A2.push(a);
        right += a;
      }
      if (A1.size() > A2.size() + 1) {
        ll p = A1.top();
        A2.push(p);
        A1.pop();
        right += p;
        left -= p;
      } else if (A1.size() + 1 < A2.size()) {
        ll p = A2.top();
        A1.push(p);
        A2.pop();
        left += p;
        right -= p;
      }
    } else {
      ll ans = B;
      ll p = 0;
      if (A1.size() >= A2.size()) {
        p = A1.top();
        // cout << p << "," << left << endl;
        ans += p * A1.size() - left;
        ans += right - p * A2.size();
      } else {
        p = A2.top();
        ans += p * A1.size() - left;
        ans += right - p * A2.size();
      }
      ANS.push_back(make_pair(p, ans));
    }
  }
  AUTO(ans, ANS) cout << ans.first << " " << ans.second << endl;
  return 0;
}


Measured memory_bytes: 6504