#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))


int main()
{
    int Q;
    cin >> Q;

    multiset<lint> as_l, as_u;
    lint bacc = 0;
    lint tot_l = 0, tot_u = 0;
    REP(_, Q)
    {
        int q;
        cin >> q;
        if (q == 1)
        {
            lint a, b;
            cin >> a >> b;
            if (as_l.empty() or a <= *as_u.begin())
            {
                as_l.insert(a);
                tot_l += a;
            }
            else
            {
                as_u.insert(a);
                tot_u += a;
            }

            if (as_l.size() > as_u.size() + 1)
            {
                lint tmp = *prev(as_l.end());
                as_u.insert(tmp);
                tot_u += tmp;
                as_l.erase(prev(as_l.end()));
                tot_l -= tmp;
            }
            if (as_u.size() > as_l.size())
            {
                lint tmp = *as_u.begin();
                as_l.insert(tmp);
                tot_l += tmp;
                as_u.erase(as_u.begin());
                tot_u -= tmp;
            }
            while (!as_u.empty() and *prev(as_l.end()) > *as_u.begin())
            {
                lint s = *prev(as_l.end());
                lint t = *as_u.begin();
                as_l.erase(prev(as_l.end()));
                tot_l += t - s;
                tot_u += s - t;
                as_u.erase(as_u.begin());
                as_l.insert(t);
                as_u.insert(s);
            }
            bacc += b;
        }
        else
        {
            lint x = *prev(as_l.end());
            printf("%lld ", x);
            printf("%lld\n", tot_u - x * (as_u.size() - as_l.size()) - tot_l + bacc);
        }
    }
}


Measured memory_bytes: 9600