#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

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

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    int Q;
    cin >> Q;
    vec<plint> ans;
    lint sum_b = 0;
    priority_queue<lint, vector<lint>, greater<lint>> larger_half;
    priority_queue<lint> smaller_half;
    lint sum_larger_half = 0, sum_smaller_half = 0;
    range(i, 0, Q) {
        int q;
        cin >> q;
        if (q == 1) {
            lint a, b;
            cin >> a >> b;
            // cout << a << " " << b << "\n";
            sum_b += b;

            smaller_half.emplace(a);
            sum_smaller_half += a;
            lint poped_item = smaller_half.top();
            larger_half.emplace(poped_item);
            sum_smaller_half -= poped_item;
            sum_larger_half += poped_item;
            smaller_half.pop();
            if (larger_half.size() > smaller_half.size()) {
                lint poped_item = larger_half.top();
                smaller_half.emplace(poped_item);
                sum_larger_half -= poped_item;
                sum_smaller_half += poped_item;
                larger_half.pop();
            }
        }
        else {
            lint smallest_point = smaller_half.top();
            lint smallest_value = sum_b
                                + (smallest_point * smaller_half.size() - sum_smaller_half)
                                + (sum_larger_half - smallest_point * larger_half.size());
            // cout << sum_b << " " << sum_smaller_half << " " << sum_larger_half << "\n";
            ans.emplace_back(smallest_point, smallest_value);
        }
    }
    for (const auto a : ans) {
        cout << a.first << " " << a.second << "\n";
    }
}

Measured memory_bytes: 5620