#include <iostream>
#include <set>
using namespace std;
typedef long long ll;
int main()
{
    int n;
    cin >> n;
    set<ll> st;
    ll razlika = 1e18;
    for(int i = 0; i < n; i++) {
        int tip;
        cin >> tip;
        if(tip == 1) {
            ll x;
            cin >> x;
            st.insert(x);
            set<ll>::iterator it = st.lower_bound(x);
            if(it != st.begin()) {
                it--;
                if(razlika > x - *it) {
                    razlika = x - *it;
                }
                it++;
            }
            it++;
            if(it != st.end()) {
                if(razlika > *it - x) {
                    razlika = *it - x;
                }
            }
        }
        else {
            cout << razlika << endl;
        }
    }
    return 0;
}
// 1 2 3 0 5 6 7 0 1 2 3 0 9 9 9