#include <iostream>
#include <string>
#define MOD1 39989
#define MOD2 1000000000
#define MAXT 40000
using namespace std;
typedef pair<double, int> pdi;
struct line {
double k, b;
} p[100005];
int s[160005];
int cnt;
double calc(int id, int d) { return p[id].b + p[id].k * d; }
void add(int x0, int y0, int x1, int y1) {
cnt++;
if (x0 == x1) // 特判直线斜率不存在的情况
p[cnt].k = 0, p[cnt].b = max(y0, y1);
else
p[cnt].k = 1.0 * (y1 - y0) / (x1 - x0), p[cnt].b = y0 - p[cnt].k * x0;
}
void upd(int root, int cl, int cr, int u) { // 对线段完全覆盖到的区间进行修改
int &v = s[root], mid = (cl + cr) >> 1;
if (calc(u, mid) > calc(v, mid)) swap(u, v);
if (calc(u, cl) > calc(v, cl)) upd(root << 1, cl, mid, u);
if (calc(u, cr) > calc(v, cr)) upd(root << 1 | 1, mid + 1, cr, u);
}
void update(int root, int cl, int cr, int l, int r,
int u) { // 定位插入线段完全覆盖到的区间
if (l <= cl && cr <= r) {
upd(root, cl, cr, u);
return;
}
int mid = (cl + cr) >> 1;
if (l <= mid) update(root << 1, cl, mid, l, r, u);
if (mid < r) update(root << 1 | 1, mid + 1, cr, l, r, u);
}
pdi pmax(pdi x, pdi y) { // pair max函数
if (x.first < y.first)
return y;
else if (x.first > y.first)
return x;
else
return x.second < y.second ? x : y;
}
pdi query(int root, int l, int r, int d) { // 查询
if (r < d || d < l) return {0, 0};
int mid = (l + r) >> 1;
double res = calc(s[root], d);
if (l == r) return {res, s[root]};
return pmax({res, s[root]}, pmax(query(root << 1, l, mid, d),
query(root << 1 | 1, mid + 1, r, d)));
}
int main() {
ios::sync_with_stdio(false);
int n, lastans = 0;
cin >> n;
while (n--) {
int op;
cin >> op;
if (op == 1) {
int x0, y0, x1, y1;
cin >> x0 >> y0 >> x1 >> y1;
x0 = (x0 + lastans - 1 + MOD1) % MOD1 + 1,
x1 = (x1 + lastans - 1 + MOD1) % MOD1 + 1;
y0 = (y0 + lastans - 1 + MOD2) % MOD2 + 1,
y1 = (y1 + lastans - 1 + MOD2) % MOD2 + 1;
if (x0 > x1) swap(x0, x1), swap(y0, y1);
add(x0, y0, x1, y1);
update(1, 1, MOD1, x0, x1, cnt);
} else {
int x;
cin >> x;
x = (x + lastans - 1 + MOD1) % MOD1 + 1;
cout << (lastans = query(1, 1, MOD1, x).second) << endl;
}
}
return 0;
}