#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


inline int sig(Int r) { return (r < 0) ? -1 : (r > 0) ? +1 : 0; }
inline Int sq(Int r) { return r * r; }
struct Pt {
  Int x, y;
  Pt() : x(0), y(0) {}
  Pt(Int x_, Int y_) : x(x_), y(y_) {}
  Pt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }
  Pt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }
  Pt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }
  Pt operator+() const { return Pt(+x, +y); }
  Pt operator-() const { return Pt(-x, -y); }
  Pt operator*(const Int &k) const { return Pt(x * k, y * k); }
  Pt operator/(const Int &k) const { return Pt(x / k, y / k); }
  friend Pt operator*(const Int &k, const Pt &a) { return Pt(k * a.x, k * a.y); }
  Pt &operator+=(const Pt &a) { x += a.x; y += a.y; return *this; }
  Pt &operator-=(const Pt &a) { x -= a.x; y -= a.y; return *this; }
  Pt &operator*=(const Pt &a) { return *this = *this * a; }
  Pt &operator*=(const Int &k) { x *= k; y *= k; return *this; }
  Pt &operator/=(const Int &k) { x /= k; y /= k; return *this; }
  Int abs2() const { return x * x + y * y; }
  Int dot(const Pt &a) const { return x * a.x + y * a.y; }
  Int det(const Pt &a) const { return x * a.y - y * a.x; }
  bool operator==(const Pt &a) const { return (x == a.x && y == a.y); }
  bool operator!=(const Pt &a) const { return !(x == a.x && y == a.y); }
  bool operator<(const Pt &a) const { return ((x != a.x) ? (x < a.x) : (y < a.y)); }
  friend ostream &operator<<(ostream &os, const Pt &a) { os << "(" << a.x << ", " << a.y << ")"; return os; }
};
inline Int tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }

// [0, 2 PI)
int cmpArg(const Pt &a, const Pt &b) {
  const int sa = (a.y > 0) ? 1 : (a.y < 0) ? 3 : (a.x > 0) ? 0 : 2;
  const int sb = (b.y > 0) ? 1 : (b.y < 0) ? 3 : (b.x > 0) ? 0 : 2;
  return (sa < sb) ? -1 : (sa > sb) ? +1 : sig(b.det(a));
}


struct DirSorter {
  // direction -eps: sort lex. by ((x, -y), u)
  vector<int> ini;
  
  // direction arg(dir)-eps ~~> arg(dir)+eps: ps[u]<ps[v] ~~> ps[v]<ps[u]
  struct Event {
    Pt dir;
    Int detU, detV;
    int u, v;
  };
  vector<Event> es;
  
  DirSorter() {}
  DirSorter(const vector<Pt> &ps) {
    const int n = ps.size();
    ini.resize(n);
    for (int u = 0; u < n; ++u) ini[u] = u;
    sort(ini.begin(), ini.end(), [&](int u, int v) -> bool {
      if (ps[u].x != ps[v].x) return (ps[u].x < ps[v].x);
      if (ps[u].y != ps[v].y) return (ps[u].y > ps[v].y);
      return (u < v);
    });
    for (int u = 0; u < n; ++u) for (int v = 0; v < n; ++v) if (ps[u] != ps[v]) {
      // u,v -> v,u
      Pt dir = Pt(0, 1) * (ps[v] - ps[u]);
      const Int g = __gcd(abs(dir.x), abs(dir.y));
      dir /= g;
      es.push_back(Event{dir, dir.det(ps[u]), dir.det(ps[v]), u, v});
    }
    sort(es.begin(), es.end(), [&](const Event &e0, const Event &e1) -> bool {
      const int s = cmpArg(e0.dir, e1.dir);
      if (s) return (s < 0);
      if (e0.detU != e1.detU) return (e0.detU > e1.detU);
      if (e0.detV != e1.detV) return (e0.detV > e1.detV);
      if (e0.u != e1.u) return (e0.u > e1.u);
      return (e0.v < e1.v);
    });
  }
  friend ostream &operator<<(ostream &os, const DirSorter &dirSorter) {
    os << "ini = " << dirSorter.ini << endl;
    for (const auto &e : dirSorter.es) os << "(" << e.dir << "; " << e.detU << ", " << e.detV << "; " << e.u << ", " << e.v << ")" << endl;
    return os;
  }
};


/*
  (variance of (a, b, c))
  = (variance of (0, x:=b-a, y:=c-a))
  = (2/9) (x^2 - x y + y^2)
  = (2/9) ((x - (1/2) y)^2 + (3/4) y^2)
*/
Int calc(const Pt &a) {
  return a.x*a.x - a.x*a.y + a.y*a.y;
}

int N;
vector<Pt> P;

int main() {
  for (; ~scanf("%d", &N); ) {
    P.resize(N);
    for (int u = 0; u < N; ++u) {
      Int a, b, c;
      scanf("%lld%lld%lld", &a, &b, &c);
      P[u] = Pt(b - a, c - a);
    }
    
    const DirSorter ds(P);
// cerr<<"P = "<<P<<endl;
// cerr<<ds<<endl;
    
    auto us = ds.ini;
    vector<int> su(N, -1);
    vector<Pt> pre(N + 1);
    pre[0] = Pt(0, 0);
    for (int i = 0; i < N; ++i) {
      su[us[i]] = i;
      pre[i + 1] = pre[i] + P[us[i]];
    }
    vector<Int> mxs(N + 1);
    for (int i = 0; i <= N; ++i) {
      mxs[i] = calc(pre[i]);
    }
    for (const auto &e : ds.es) {
      const int u = e.u;
      const int v = e.v;
      const int i = su[u];
      const int j = su[v];
      assert(i + 1 == j);
      chmax(mxs[j], calc(pre[j] = pre[j] - P[u] + P[v]));
      swap(su[u], su[v]);
      swap(us[i], us[j]);
    }
    
    for (int k = 1; k <= N; ++k) {
      Mint ans = mxs[k];
      ans *= 2;
      ans /= 9;
      ans /= Mint(k) * Mint(k);
      printf("%u\n", ans.x);
    }
  }
  return 0;
}