#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
using namespace std;

const int OO = 1e9;
const double EPS = 1e-9;

#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " << __LINE__  \
		<< ": "; _db(#__VA_ARGS__, __VA_ARGS__);})
#define RNG() rng()
#else
#define db(...) true
#define RNG() true
#endif

template<class T>
void _db(const char *dbStr, T e) {
	cout << dbStr << " = " << e << endl;
}
template<class T, class... L>
void _db(const char *dbStr, T e, L... r) {
  while(*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ','; _db(dbStr + 1, r...);
}
template<class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
	o << "["; int i = 0;
	for (const pair<S, T>& pr : v) o << (!i++ ? "" : ", ") << "{"
	<< pr.fs << " : " << pr.sc << "}"; return o << "]";
}
template<template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
	o << "["; int i = 0;
	for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
	return o << "]";
}
template<class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
	return o << "(" << pr.fs << ", " << pr.sc << ")";
}
ostream& operator<<(ostream& o, const string& s) {
	for (const char& c : s) o << c;
	return o;
}

template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;


typedef
tree<
  pii,
  null_type,	// put a type to use as a map
  less<pii>,
  rb_tree_tag,
  tree_order_statistics_node_update>
ordered_set;

template<class T> using pb_set = tree<T, null_type,
	less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class S> using pb_map = tree<T, S,
	less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template<class S, class T>
ostream& operator<<(ostream& o, const pb_map<S, T>& v) {
	o << "["; int i = 0;
	for (const pair<S, T>& pr : v) o << (!i++ ? "" : ", ") << "{"
	<< pr.fs << " : " << pr.sc << "}"; return o << "]";
}
template<class T>
ostream& operator<<(ostream& o, const pb_set<T>& v) {
	o << "["; int i = 0;
	for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
	return o << "]";
}

int Q, n;
ll sumB;
set<pii> L, R;
ll sumL, sumR;
pb_set<pii> s;

const int MX = 1000000001;

int main() {
	#ifdef LOCAL
	auto stTime = clock();
	freopen("in.txt", "r", stdin);
	mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	ios::sync_with_stdio(false);
	cout.precision(10);
	cin.tie(0);

	cin >> Q;

	for (int i = 1; i <= Q; ++i) {
		int type;
		cin >> type;
		if (type == 1) {
			int a, b;
			cin >> a >> b;
			sumB += b;
			s.insert(mp(a, i));
			R.insert(mp(a, i));
			sumR += a + MX;
			++n;
			while (sz(L) < n / 2) {
				pii pr = *R.begin();
				R.erase(R.begin());
				sumR -= pr.fs + MX;
				L.insert(pr);
				sumL += MX - pr.fs;
			}
			while (!L.empty() && *L.rbegin() > *R.begin()) {
				pii prR = *R.begin();
				R.erase(R.begin());
				sumR -= prR.fs + MX;

				pii prL = *(--L.end());
				L.erase(--L.end());
				sumL -= MX - prL.fs;

				L.insert(prR);
				sumL += MX - prR.fs;
				R.insert(prL);
				sumR += prL.fs + MX;
			}
		} else {
			int x = s.find_by_order(n / 2 - (n % 2 == 0))->fs;
//			db(x);
			assert(sz(L) == n / 2 && sz(R) == n - n / 2 && sz(L) <= sz(R));
			cout << x << ' ' << sumB + (sumR - sz(R) * 1LL * (x + MX)) + (sumL - sz(L) * 1LL * (MX - x)) << '\n';
		}
//		db(L, R, s, n);
	}



	#ifdef LOCAL
	cout << "\n\n\nExecution time: " <<
		(clock() - stTime) * 1e3 / CLOCKS_PER_SEC << " ms" << endl;
	#endif
    return 0;
}


Measured memory_bytes: 22144