#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(false);

  int Q; { cin >> Q; }

  vector<int> T(Q), X(Q); {
    for (int i = 0; i < Q; ++i) cin >> T[i] >> X[i];
  }

  vector<int64_t> addedX; {
    int64_t s = 0;
    for (int i = 0; i < Q; ++i) {
      if (T[i] == 3) s += X[i];
      if (T[i] == 1) addedX.push_back(X[i] - s);
    }
  }

  map<int64_t, int> mpX; 
  vector<int64_t> distinctX; {
    distinctX = addedX;
    sort(distinctX.begin(), distinctX.end());
    distinctX.erase(unique(distinctX.begin(), distinctX.end()), distinctX.end());
    for (int i = 0; i < distinctX.size(); ++i) mpX[distinctX[i]] = i;
  }

  vector<int64_t> dat(distinctX.size() + 1);
  auto add = [&](int x, int v) { for (int i = x + 1; i < dat.size(); i += i & -i) dat[i] += v; };
  auto sum = [&](int x) {
    int r = 0;
    for (int i = x + 1; i; i -= i & -i) r += dat[i];
    return r;
  };

  int64_t s = 0;
  for (int i = 0; i < Q; ++i) {
    if (T[i] == 1) {
      add(mpX[X[i] - s], +1);
    } else if (T[i] == 2) {
      add(mpX[addedX[X[i] - 1]], -1);
    } else {
      s += X[i];
    }
    auto solve = [&]() {
      int64_t lb = 0; 
      int64_t ub = (int64_t) 1 << 60;
      while (ub - lb > 1) {
        int64_t mb = lb + ub >> 1;
        int x = lower_bound(distinctX.begin(), distinctX.end(), mb - s) - distinctX.begin();
        int64_t cnt = sum(distinctX.size() - 1) - sum(x - 1);
        (cnt >= mb ? lb : ub) = mb;
      }
      return lb;
    };
    cout << solve() << "\n";
  }
}