class Sgt { constructor(size) { this.sum = new Array(size << 2).fill(0); } add(t, lb, rb, k, v) { rb = rb || this.sum.length >> 2; if (rb - lb == 1) { this.sum[t] += v; return; } let mb = lb + rb >> 1; if (k < mb) this.add(t << 1, lb, mb, k, v); else this.add(t << 1 | 1, mb, rb, k, v); this.sum[t] = this.sum[t << 1] + this.sum[t << 1 | 1]; } qry(t, lb, rb, ql, qr) { rb = rb || this.sum.length >> 2; qr = qr || rb; if (qr <= lb || rb <= ql) return 0; if (ql <= lb && rb <= qr) return this.sum[t]; let mb = lb + rb >> 1; return this.qry(t << 1, lb, mb, ql, qr) + this.qry(t << 1 | 1, mb, rb, ql, qr); } } function Main(input) { let inputs = input.split('\n'); let q = Number(inputs[0]); let ts = [...Array(q).keys()].map((e) => inputs[1 + e].split(' ').map((x) => x - 0)); let ps = new Array(q); let qid = new Array(0); let sadd = 0; for (let i = 0; i < q; ++i) { if (ts[i][0] == 1) { ps[i] = ts[i][1] - sadd; qid.push(i); } else if (ts[i][0] == 3) { sadd += ts[i][1]; } } let sorted_ps = ps.slice(0).filter((e) => e != null).sort(); let uniq_ps = new Array(0); let psmp = {}; for (let i = 0, j = 0; i < sorted_ps.length; ++i) { if (i == 0 || sorted_ps[i] != sorted_ps[i - 1]) { psmp[sorted_ps[i]] = uniq_ps.length; uniq_ps.push(sorted_ps[i]); } } let root = new Sgt(uniq_ps.length); let gadd = 0; for (let i = 0; i < q; ++i) { if (ts[i][0] == 1) { root.add(1, 0, null, psmp[ps[i]], 1); } else if (ts[i][0] == 2) { root.add(1, 0, null, psmp[ps[qid[ts[i][1] - 1]]], -1); } else { gadd += ts[i][1]; } let lb, ub; [lb, ub] = [0, q + 1]; while (ub - lb > 1) { let mb = lb + ub >> 1; if (sorted_ps[sorted_ps.length - 1] < mb - gadd) { ub = mb; continue; } let x, y; [x, y] = [-1, sorted_ps.length - 1]; while (y - x > 1) { let z = x + y >> 1; if (sorted_ps[z] >= mb - gadd) { y = z; } else { x = z; } } let s = root.qry(1, 0, null, y, null); if (s >= mb) { lb = mb; } else { ub = mb; } } console.log(lb); } } Main(require('fs').readFileSync('/dev/stdin', 'utf8'));