#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int M = 1e9, N = 6000005;
int n = 1;
int s[N], L[N], R[N];
void upd(int u, int v, int id = 1, int l = 1, int r = M) {
if (s[id] == r - l + 1) {
return;
}
if (u <= l && r <= v) {
s[id] = r - l + 1;
return;
}
int m = (l + r) / 2;
if (u <= m) {
if (!L[id]) {
L[id] = ++n;
}
upd(u, v, L[id], l, m);
}
if (m < v) {
if (!R[id]) {
R[id] = ++n;
}
upd(u, v, R[id], m + 1, r);
}
s[id] = s[L[id]] + s[R[id]];
}
int qry(int u, int v, int id = 1, int l = 1, int r = M) {
if (s[id] == r - l + 1) {
return min(v, r) - max(l, u) + 1;
}
if (u <= l && r <= v) {
return s[id];
}
int m = (l + r) / 2;
int res = 0;
if (u <= m) {
res += L[id] ? qry(u, v, L[id], l, m) : 0;
}
if (m < v) {
res += R[id] ? qry(u, v, R[id], m + 1, r) : 0;
}
return res;
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int m; cin >> m;
int c = 0;
while (m--) {
int d, x, y; cin >> d >> x >> y;
x += c, y += c;
if (d == 1) {
cout << (c = qry(x, y)) << "\n";
} else {
upd(x, y);
}
}
return 0;
}
