#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <complex>
#include <chrono>
#include <random>
#include <numeric>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <stack>
#include <limits>
#include <climits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <set>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <type_traits>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define inf 0x3f3f3f3f3f3f3f3f
#define ALL(a) (a).begin(), (a).end()
#define DEBUG(x) // cerr<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
using pii = pair<ll, ll>;
#define eps 1e-14
#define SETUP cin.tie(0), ios::sync_with_stdio(false), cout << setprecision(15) << std::fixed;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)

template <class T>
using vec2 = std::vector<vector<T>>;

//// bit ////
#ifdef _MSC_VER
#ifdef _WIN32
inline unsigned int __builtin_ctz(unsigned int x) { unsigned long r; _BitScanForward(&r, x); return r; }
inline unsigned int __builtin_clz(unsigned int x) { unsigned long r; _BitScanReverse(&r, x); return 31 - r; }
inline unsigned int __builtin_ffs(unsigned int x) { unsigned long r; return _BitScanForward(&r, x) ? r + 1 : 0; }
// inline unsigned int __builtin_popcount(unsigned int x){ return __popcnt(x); }
#ifdef _WIN64
inline unsigned long long __builtin_ctzll(unsigned long long x) { unsigned long r; _BitScanForward64(&r, x); return r; }
inline unsigned long long __builtin_clzll(unsigned long long x) { unsigned long r; _BitScanReverse64(&r, x); return 63 - r; }
inline unsigned long long __builtin_ffsll(unsigned long long x) { unsigned long r; return _BitScanForward64(&r, x) ? r + 1 : 0; }
inline unsigned long long __builtin_popcountll(unsigned long long x) { return __popcnt64(x); }
#else
inline unsigned int hidword(unsigned long long x) { return static_cast<unsigned int>(x >> 32); }
inline unsigned int lodword(unsigned long long x) { return static_cast<unsigned int>(x & 0xFFFFFFFF); }
inline unsigned long long __builtin_ctzll(unsigned long long x) { return lodword(x) ? __builtin_ctz(lodword(x)) : __builtin_ctz(hidword(x)) + 32; }
inline unsigned long long __builtin_clzll(unsigned long long x) { return hidword(x) ? __builtin_clz(hidword(x)) : __builtin_clz(lodword(x)) + 32; }
inline unsigned long long __builtin_ffsll(unsigned long long x) { return lodword(x) ? __builtin_ffs(lodword(x)) : hidword(x) ? __builtin_ffs(hidword(x)) + 32 : 0; }
// inline unsigned long long __builtin_popcountll(unsigned long long x) { return __builtin_popcount(lodword(x)) + __builtin_popcount(hidword(x)); }
#endif // _WIN64
#endif // _WIN32
#endif // _MSC_VER

namespace
{
	struct input_returnner
	{
		ll N;
		input_returnner(ll N_ = 0) : N(N_) {}
		template <typename T>
		operator vector<T>() const
		{
			vector<T> res(N);
			for (auto& a : res)
				cin >> a;
			return std::move(res);
		}
		template <typename T>
		operator T() const
		{
			T res;
			cin >> res;
			return res;
		}
		template <typename T>
		T operator-(T right) { return T(input_returnner()) - right; }
		template <typename T>
		T operator+(T right) { return T(input_returnner()) + right; }
		template <typename T>
		T operator*(T right) { return T(input_returnner())* right; }
		template <typename T>
		T operator/(T right) { return T(input_returnner()) / right; }
		template <typename T>
		T operator<<(T right) { return T(input_returnner()) << right; }
		template <typename T>
		T operator>>(T right) { return T(input_returnner()) >> right; }
	};
	template <typename T>
	input_returnner in() { return in<T>(); }
	input_returnner in() { return input_returnner(); }
	input_returnner in(ll N) { return std::move(input_returnner(N)); }
} // namespace

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

template <typename T>
struct is_vector : std::false_type
{
};

template <typename T>
struct is_vector<std::vector<T>> : std::true_type
{
};

template <typename T>
constexpr bool is_vector_v = is_vector<T>::value;

template <typename T>
std::ostream& operator<<(std::ostream & out, const std::vector<T> & v)
{
	if (!v.empty())
	{
		for (int i = 0; i < v.size(); ++i)
		{
			out << v[i] << (i == v.size() - 1 ? "\n" : (is_vector_v<T> ? "" : ", "));
		}
	}
	return out;
}

namespace std
{
	// ref: https://stackoverflow.com/questions/7110301/generic-hash-for-tuples-in-unordered-map-unordered-set
	template <class T>
	inline void hash_combine(std::size_t& seed, T const& v)
	{
		seed ^= std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
	}

	// Recursive template code derived from Matthieu M.
	template <class Tuple, size_t Index = std::tuple_size<Tuple>::value - 1>
	struct HashValueImpl
	{
		static void apply(size_t& seed, Tuple const& tuple)
		{
			HashValueImpl<Tuple, Index - 1>::apply(seed, tuple);
			hash_combine(seed, std::get<Index>(tuple));
		}
	};

	template <class Tuple>
	struct HashValueImpl<Tuple, 0>
	{
		static void apply(size_t& seed, Tuple const& tuple)
		{
			hash_combine(seed, std::get<0>(tuple));
		}
	};
	template <typename... TT>
	struct hash<std::tuple<TT...>>
	{
		size_t operator()(std::tuple<TT...> const& tt) const
		{
			size_t seed = 0;
			HashValueImpl<std::tuple<TT...>>::apply(seed, tt);
			return seed;
		}
	};

	template <class T, class U>
	class hash<std::pair<T, U>>
	{
	public:
		size_t operator()(const std::pair<T, U>& x) const
		{
			return hash<std::tuple<T, U>>()(std::tie(x.first, x.second));
		}
	};
} // namespace std

// ref: https://stackoverflow.com/questions/6245735/pretty-print-stdtuple
namespace aux
{
	template <std::size_t...>
	struct seq
	{
	};

	template <std::size_t N, std::size_t... Is>
	struct gen_seq : gen_seq<N - 1, N - 1, Is...>
	{
	};

	template <std::size_t... Is>
	struct gen_seq<0, Is...> : seq<Is...>
	{
	};

	template <class Ch, class Tr, class Tuple, std::size_t... Is>
	void print_tuple(std::basic_ostream<Ch, Tr>& os, Tuple const& t, seq<Is...>)
	{
		using swallow = int[];
		(void)swallow {
			0, (void(os << (Is == 0 ? "" : ", ") << std::get<Is>(t)), 0)...
		};
	}
} // namespace aux

template <class Ch, class Tr, class... Args>
auto operator<<(std::basic_ostream<Ch, Tr> & os, std::tuple<Args...> const& t)
-> std::basic_ostream<Ch, Tr> &
{
	os << "(";
	aux::print_tuple(os, t, aux::gen_seq<sizeof...(Args)>());
	return os << ")";
}

template <class S, class T>
std::ostream& operator<<(std::ostream & os, const std::pair<S, T> & p)
{
	return os << "(" << p.first << ", " << p.second << ")";
}

// ref: https://stackoverflow.com/questions/8542591/c11-reverse-range-based-for-loo�Fp
template <typename T>
struct reversion_wrapper
{
	T& iterable;
};

template <typename T>
auto begin(reversion_wrapper<T> w) { return std::rbegin(w.iterable); }

template <typename T>
auto end(reversion_wrapper<T> w) { return std::rend(w.iterable); }

template <typename T>
reversion_wrapper<T> REV(T && iterable) { return { iterable }; }

template <class T>
bool inside(T left, T val, T right)
{
	return left <= val and val < right;
}

template <class T>
T bitCount(T num)
{
	T res = 0;
	while (num > 0)
	{
		if (num & 1)
			++res;
		num >>= 1;
	}
	return res;
}

ll MOD = 1e9 + 7;
//ll MOD = 998244353;

void solve();

signed main()
{
	SETUP;
#ifdef _DEBUG
	while (true)
	{
#endif
		solve();
#ifdef _DEBUG
		cout << "-------" << endl;
	}
#endif
#ifdef _DEBUG
	system("pause");
#endif
	return 0;
}

#define int ll

struct mint {
	int64_t value;
	mint():value(0){}
	mint(int64_t value_) : value(value_%MOD) {}
	inline mint& operator += (const mint& rhs) {
		value += rhs.value;
		if (value >= MOD) { value -= MOD; }
		return *this;
	}
	inline mint& operator -= (const mint& rhs) {
		value -= rhs.value;
		if (value < 0) {
			value += MOD;
		}
		return *this;
	}
	inline mint& operator *= (const mint& rhs) {
		value *= rhs.value;
		value %= MOD;
		return *this;
	}
	inline mint& operator %= (const mint& rhs) {
		return *this;
	}
};

inline mint operator + (const mint& lhs, const mint& rhs) { mint res = lhs; res += rhs; return res; }
inline mint operator - (const mint& lhs, const mint& rhs) { mint res = lhs;	res -= rhs;	return res; }
inline mint operator * (const mint& lhs, const mint& rhs) { mint res = lhs;	res *= rhs;	return res; }
inline mint operator % (const mint& lhs, const uint64_t& rhs) { return lhs; }

ostream & operator << (ostream & out, mint n) { return out << n.value; }

struct BIT {
	vector<int> bit;
	int n;

	BIT(int N) :n(N+2), bit((N+2) * 2){}

	int sum(int i) {
		++i;
		int s = 0;
		while (i > 0) {
			s += bit[i];
			i -= i&-i;
		}
		return s;
	}

	void add(int i, int x) {
		++i;
		while (i <= n) {
			bit[i] += x;
			i += i & (-i);
		}
	}
};

// 左にcnt個ある要素を探す
int search_index(BIT& bit, int size, int cnt, const set<int>& points) {
	int ok = size-1;
	int ng = -1;
	while (abs(ok - ng) > 1) {
		int mid = (ok + ng) / 2;
		if (bit.sum(mid) >= cnt) {
			ok = mid;
		}
		else {
			ng = mid;
		}
	}
	auto it = points.upper_bound(ok);
	--it;
	return *it;
}

vector<pii> solve(vector<tuple<int, int, int> >& Q, set<int>& all_points, int lleft, int rright) {
	vector<pii> out;
	BIT BITleft(all_points.size());
	BIT BITleftcnt(all_points.size());
	BIT BITright(all_points.size());
	BIT BITrightcnt(all_points.size());
	unordered_map<int, int> enc;
	vector<int> dec;

	for (auto& p : all_points) {
		dec.push_back(p);
		enc[p] = dec.size() - 1;
	}

	int bsum = 0;
	set<int> points;
	int point_cnt = 0;
	for (auto& query : Q) {
		int t, p, b; tie(t, p, b) = query;

		if (t == 1) {
			bsum += b;
			BITleft.add(enc[p], p - lleft);
			BITleftcnt.add(enc[p], 1);
			BITright.add(enc.size() - enc[p] - 1, rright - p);
			BITrightcnt.add(enc.size() - enc[p] - 1, 1);
			points.emplace(enc[p]);
			point_cnt++;
		}
		if (t == 2) {
			if (points.size() == 0) {
				cout << 0 << endl;
				continue;
			}
			int half = point_cnt/2 + (point_cnt%2);
			int index = search_index(BITleftcnt, all_points.size(), half, points);
			int p = dec[index];
			int res = 0;
			res += BITleftcnt.sum(index) * (p - lleft);
			res -= BITleft.sum(index);
			res += BITrightcnt.sum(enc.size() - index - 1) * (rright-p);
			res -= BITright.sum(enc.size() - index - 1);
			//cout << BITleftcnt.sum(index) * (p - lleft) << endl;
			//cout << BITleft.sum(index) << endl;
			//cout << BITrightcnt.sum(enc.size() - index - 1) * (rright-p) << endl;
			//cout << BITright.sum(enc.size() - index - 1) << endl;
			out.emplace_back(p, res + bsum);
		}
	}
	return out;
}

vector<pii> solve2(vector<tuple<int, int, int> >& Q, set<int>& all_points, int lleft, int rright) {
	int bsum = 0;
	vector<int> points;
	for (auto& query : Q) {
		if (get<0>(query) == 1) {
			bsum += get<2>(query);
			points.emplace_back(get<1>(query));
		}
	}

	int N = points.size();
	pii ans = { numeric_limits<int>::max(), -1 };
	REP(i, N) {
		pii res = { 0, points[i] };
		REP(j, N) {
			res.first += abs(points[i] - points[j]);
		}
		ans = min(res, ans);
	}
	return { {ans.second, ans.first + bsum} };
}

//本番！
void solve() {
	vector<tuple<int, int, int> > Q;
	int lleft = numeric_limits<int>::max();
	int rright = numeric_limits<int>::min();

	set<int> all_points;

	{
		int Qsize; cin >> Qsize;
		REP(i, Qsize) {
			int t; cin >> t;
			if (t == 1) {
				int a, b; cin >> a >> b;
				Q.emplace_back(t,a,b);
				lleft = min(a, lleft);
				rright = max(a, rright);
				all_points.emplace(a);
			}
			else {
				Q.emplace_back(t, 0, 0);
			}
		}
	}
	auto res1 = solve(Q, all_points, lleft, rright);
	for (auto& a : res1) {
		cout << a.first << " " << a.second << endl;
	}
}

// 手動テスト
//void solve() {
//	vector<tuple<int, int, int> > Q;
//	int lleft = numeric_limits<int>::max();
//	int rright = numeric_limits<int>::min();
//
//	set<int> all_points;
//
//	{
//		int Qsize; cin >> Qsize;
//		REP(i, Qsize) {
//			int t; cin >> t;
//			if (t == 1) {
//				int a, b; cin >> a >> b;
//				Q.emplace_back(t,a,b);
//				lleft = min(a, lleft);
//				rright = max(a, rright);
//				all_points.emplace(a);
//			}
//			else {
//				Q.emplace_back(t, 0, 0);
//			}
//		}
//	}
//	auto res1 = solve(Q, all_points, lleft, rright);
//	auto res2 = solve2(Q, all_points, lleft, rright);
//	cout << res1;
//	cout << res2;
//}


// ランダムテスト
//void solve() {
//	REP(i, 1000) {
//		vector<tuple<int, int, int> > Q;
//		int lleft = numeric_limits<int>::max();
//		int rright = numeric_limits<int>::min();
//
//		std::random_device rd; // obtain a random number from hardware
//		std::mt19937 eng(rd()); // seed the generator
//		std::uniform_int_distribution<> distr(-1e9, 1e9); // define the range
//
//		set<int> all_points;
//		{
//			int Qsize = 10000;
//			REP(i, Qsize) {
//				int t = 1;
//				if (t == 1) {
//					int a = distr(eng);
//					int b = distr(eng);
//					Q.emplace_back(t, a, b);
//					lleft = min(a, lleft);
//					rright = max(a, rright);
//					all_points.emplace(a);
//				}
//			}
//		}
//		Q.emplace_back(2, 0, 0);
//		auto res1 = solve(Q, all_points, lleft, rright);
//		auto res2 = solve2(Q, all_points, lleft, rright);
//		cout << res1.back() << endl;
//		cout << res2.back() << endl;
//		if (res1.back() != res2.back()) {
//			for (auto& query : Q) {
//				int a, b, c; tie(a, b, c) = query;
//				cout << vector<int>{a, b, c};
//			}
//		}
//		assert(res1.back() == res2.back());
//	}
//}


Measured memory_bytes: 30252