#include <bits/stdc++.h>

#define M_PI 3.14159265358979323846

using namespace std;

//typedef
//-------------------------#include <bits/stdc++.h>

#define M_PI 3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s)
{
    int v;
    istringstream sin(s);
    sin >> v;
    return v;
}
template <class T>
inline string toString(T x)
{
    ostringstream sout;
    sout << x;
    return sout.str();
}
inline int readInt()
{
    int x;
    scanf("%d", &x);
    return x;
}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

//repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
//#define MOD 1000000007

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;

#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const int INF = 2147483647;

const int MAX = 510000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++)
    {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int dxy[5] = {-1, 0, 1, 0, -1};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);

    int q;
    cin >> q;
    ll sum = 0, front = 0, back = 0;

    priority_queue<ll> small;

    priority_queue<ll, vector<ll>, greater<ll>> large;
    while (q--)
    {
        int t;
        cin >> t;
        if (t == 1)
        {

            ll a, b;
            cin >> a >> b;
            sum += b;
            if (small.size() == 0)
            {
                small.push(a);
                front += a;
                continue;
            }
            else
            {
                if (small.size() == large.size() + 1)
                {
                    if (small.top() <= a)
                    {
                        large.push(a);
                        back += a;
                    }
                    else
                    {

                        ll tmp = small.top();
                        front -= tmp;
                        small.pop();
                        large.push(tmp);
                        back += tmp;
                        small.push(a);
                        front += a;
                    }
                }
                else if (small.size() == large.size())
                {
                    ll t = large.top();
                    if (a <= t)
                    {
                        small.push(a);
                        front += a;
                    }
                    else
                    {
                        large.pop();
                        back -= t;
                        small.push(t);
                        front += t;
                        large.push(a);
                        back += a;
                    }
                }
            }
        }
        else if (t == 2)
        {
            ll med = small.top();
            cout << med << " " << (med * (ll)small.size() - front) + (back - med * (ll)large.size()) + sum << endl;
        }
        //cout << small.size() << " " << large.size() << endl;
    }
    return 0;
}


Measured memory_bytes: 3828