#include "nice_lines.h"
#include<bits/stdc++.h>
#define ll long long
#define db long double
#define ull unsigned long long
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
using namespace std;
const int X = 100000, lim = 10000;
const db eps = 1e-5;
vector<int> ans1, ans2;
struct Line {db k, b;};
Line calc(int id) {
  db sx = (id - 1) * X + lim + lim;
  db tx = id * X - lim - lim;
  db sy = query(X, sx), ty = query(X, tx);
  // cout << sx << ' ' << tx << endl;
  db k = (sy - ty) / (sx - tx), b = (ty * sx - sy * tx) / (sx - tx);
  assert(fabs(k * sx + b - sy) < eps);
  // cout << k << ' ' << b << endl;
  return {k, b};
}
void solve(int l, int r, Line vl, Line vr) {
  if(fabs(vl.k - vr.k) < eps)return ;
  db x = -(vr.b - vl.b) / (vr.k - vl.k);
  db y = (vr.k * vl.b - vl.k * vr.b) / (vr.k - vl.k);
  db z = query(X, x);
  if(fabs(y - z) < eps) {
    int a = round(x / X);
    int b = round(x - a * X);
    ans1.pb(a); ans2.pb(b);
    return ;
  }
  if(r - l == 1)return ;
  int mid = max(min((int)ceil(x / X), r - 1), l + 1);
  Line vm = calc(mid);
  solve(l, mid, vl, vm); solve(mid, r, vm, vr);
  return ;
}
void solve(int subtask_id, int N) {
  solve(-lim, lim + 1, calc(-lim), calc(lim + 1));
  the_lines_are(ans1, ans2);
}