#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#include <cassert>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <chrono>
#include <random>
#include <thread>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define all(c) c.begin(), c.end()
#define repeat(i, n) for (int i = 0; i < static_cast<int>(n); i++)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "{";
    for (auto it = v.begin(); it != v.end(); ++it) {
        if (it != v.begin())
            os << ",";
        os << *it;
    }
    return os << "}";
}

template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& v)
{
    os << "{";
    os << v.first << ", " << v.second;
    return os << "}";
}

// ---------------------------------------------------------------------------

using point = complex<double>;
using ll = int64_t;

struct query {
    int type;
    int a, b;
};

int invalid = -1000000001;
int my_main(int argc, char** argv)
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int q;
    cin >> q;

    vector<query> qs;
    for (int i = 0; i < q; i++) {
        int t;
        cin >> t;
        query q;
        q.type = t;
        if (t == 1) {
            int a, b;
            cin >> a >> b;
            q.a = a;
            q.b = b;
        }
        qs.push_back(q);
    }

    multiset<int, greater<int>> left;
    multiset<int> right;

    const int INF = 1000000010;
    left.insert(-INF);
    left.insert(-INF);

    right.insert(INF);
    right.insert(INF);

    ll ret = 0;
    for (const auto& q : qs) {
        if (q.type == 1) {
            ret += q.b;

            int left_end = *left.begin();
            int right_end = *right.begin();

            if (q.a < left_end) {
                auto it1 = left.begin();
                auto it2 = left.begin();
                it2++;
                left.erase(it1, it2);
                right.insert(left_end);

                left.insert(q.a);
                left.insert(q.a);

                ret += left_end - q.a;
            } else if (left_end <= q.a && q.a <= right_end) {
                left.insert(q.a);
                right.insert(q.a);
            } else {
                auto it1 = right.begin();
                auto it2 = right.begin();
                it2++;
                right.erase(it1, it2);
                left.insert(right_end);

                right.insert(q.a);
                right.insert(q.a);

                ret += q.a - right_end;
            }
        } else {
            int left_end = *left.begin();
            cout << left_end << " " << ret << endl;
        }
    }

    // sort(all(as));

    //int k = (as.size() - 1) / 2;
    //ll r = bt;
    //for (int i = 0; i < as.size(); i++) {
    //    if (i < k) {
    //        r += as[k] - as[i];
    //    } else if (i > k) {
    //        r += as[i] - as[k];
    //    }
    //}

    //std::map<int, std::queue<int>> indexes;
    //for (int i = 0; i < as.size(); i++) {
    //    auto it = indexes.find(as[i]);
    //    if (it != indexes.end()) {
    //        it->second.push(i);
    //    } else {
    //        queue<int> p;
    //        p.push(i);
    //        indexes[as[i]] = p;
    //    }
    //}

    //for (int i = q - 1; i >= 0; i--) {
    //    query qu = qs[i];

    //    if (qu.type == 1) {
    //        cout << r << endl;
    //    } else {
    //        int a = qu.a;
    //        int index = indexes[a].front();
    //        indexes[a].pop();

    //        as.erase(as.begin() + index, as.begin() + index + 1);
    //        int nk = (as.size() - 1) / 2;

    //    }
    //}

    return 0;
}

// ----------------------------------------------------------------------------
// Test driver

#ifdef DEBUG
#define MAY_RUN_TESTCASE
#endif

#ifdef MAY_RUN_TESTCASE
#include <fstream>

#if __has_include(<unistd.h>)
// Mac, Linux
#include <unistd.h>
#elif __has_include(<io.h>)
// Windows
#include <io.h>
#else
// Other?
#error "unistd.h or io.h not found"
#endif

bool test_file_exists(const std::string& str)
{
    std::ifstream fs(str);
    return fs.is_open();
}

#endif

int main(int argc, char** argv)
{
#ifndef MAY_RUN_TESTCASE
    return my_main(argc, argv);
#else
    if (argc == 1) {
        return my_main(argc, argv);
    } else if (argc == 2) {

        char* stdin_file = argv[1];
        freopen(stdin_file, "r", stdin);
        return my_main(argc, argv);

    } else if (argc == 5) {

        std::string stdin_file = argv[1];
        std::string expected_file = argv[2];
        std::string stdout_file = argv[3];
        std::string stderr_file = argv[4];

        if (!test_file_exists(stdin_file)) {
            std::cerr << stdin_file << " not found" << std::endl;
            return 3;
        }

        if (!test_file_exists(expected_file)) {
            std::cerr << expected_file << " not found" << std::endl;
            return 3;
        }

        int original_stdin = dup(fileno(stdin));
        int original_stdout = dup(fileno(stdout));
        int original_stderr = dup(fileno(stderr));

        freopen(stdin_file.c_str(), "r", stdin);
        freopen(stdout_file.c_str(), "w", stdout);
        freopen(stderr_file.c_str(), "w", stderr);

        int ret = my_main(argc, argv);

        fflush(stdout);
        fflush(stderr);

        dup2(original_stderr, fileno(stderr));
        dup2(original_stdout, fileno(stdout));
        dup2(original_stdin, fileno(stdin));

        if (ret != 0) {
            std::cerr << "main returns " << ret << std::endl;
            return ret;
        }

        std::ifstream inp(stdin_file);
        std::ifstream out(stdout_file);
        std::ifstream err(stderr_file);
        std::ifstream exp(expected_file);

        // Clear is needed if the file is empty.
        std::cout << "----- input -----" << std::endl;
        std::cout << inp.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl
                  << std::endl;

        std::cout << "----- output ----" << std::endl;
        std::cout << out.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl
                  << std::endl;

        std::cout << "---- expected ---" << std::endl;
        std::cout << exp.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl
                  << std::endl;

        std::cout << "----- stderr ----" << std::endl;
        std::cout << err.rdbuf() << std::endl;
        std::cout.clear();
        std::cout << "-----------------" << std::endl;

        inp.seekg(0);
        out.seekg(0);
        exp.seekg(0);
        err.seekg(0);

        std::string output_str, expected_str;
        {
            std::stringstream output_ss;
            output_ss << out.rdbuf();
            output_str = output_ss.str();

            std::stringstream expected_ss;
            expected_ss << exp.rdbuf();
            expected_str = expected_ss.str();
        }

        // Remove trailing spaces
        output_str.erase(output_str.find_last_not_of(" \n\r\t") + 1);
        expected_str.erase(expected_str.find_last_not_of(" \n\r\t") + 1);

        if (output_str == expected_str)
            return 0;
        else
            return 1;
    }
    return 1;
#endif
}


Measured memory_bytes: 21744