#include <bits/stdc++.h>
using namespace std;
const int nax = 1e5;
map<int,int> tree;
map<int,int> lazy;
int m;
void cek (int idx, int l, int r) {
if (!lazy.count(idx)) return;
tree[idx] = lazy[idx];
int m = (l+r)>>1;
if (l!=r) {
lazy[idx<<1] += m-l+1;
lazy[idx<<1|1] += r-m;
}
lazy.erase(idx);
}
void upd (int fr, int to, int idx = 1, int l = 1, int r = 1e9) {
cek(idx, l, r);
if (fr <= l && r <= to) {
lazy[idx] = r-l+1;
cek(idx,l,r) ;
} else if (r < fr || l > to) return;
else {
int m = (l+r)>>1;
upd(fr, to, idx<<1,l,m);
upd(fr, to, idx<<1|1, m+1,r);
tree[idx] = tree[idx<<1] + tree[idx<<1|1];
}
}
int get (int fr, int to, int idx = 1, int l = 1, int r = 1e9) {
cek(idx, l, r);
if (!tree.count(idx)) return 0;
if (fr <= l && r <= to) return tree[idx];
else if (r < fr || l > to) return 0;
else {
int m = (l+r)>>1;
return get(fr, to, idx<<1, l, m) + get(fr, to, idx<<1|1, m+1, r);
}
}
signed main() {
scanf("%d", &m);
int c = 0;
while (m--) {
int d, x, y;
scanf("%d %d %d", &d, &x, &y);
x += c; y += c;
if (d == 1) {
int ans = get(x, y);
c += ans;
printf("%d\n",ans);
} else {
upd(x,y);
}
}
}
/*
*/
