#include <bits/stdc++.h>
using namespace std;
const int infi = 1e9 + 7;
const long long infl = (long long)1e18 + (long long)7;
const long long mod = 998244353;
long long sum[300500];
long long get_sum(int l, int r) {
  if (l > r) {
    return 0;
  }
  if (l) {
    return sum[r] - sum[l - 1];
  }
  return sum[r];
}
long long ar[300500];
long long pow(long long a, long long p) {
  long long ans = 1;
  while (p) {
    if (p & 1LL) {
      ans *= a;
      ans %= mod;
    }
    a *= a;
    a %= mod;
    p >>= 1;
  }
  return ans;
}
long long norm(long long a, long long n) { return (a * pow(n, mod - 2)) % mod; }
int32_t main() {
  cin.sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < (n); ++i) {
    cin >> ar[i];
  }
  sort(ar, ar + n);
  reverse(ar, ar + n);
  for (int i = 0; i < (n); ++i) {
    if (i) sum[i] = sum[i - 1];
    sum[i] += ar[i];
    sum[i] %= mod;
  }
  for (int len = 1; len < n; ++len) {
    long long ans = 0;
    for (long long w = 1, l = len; l < n; l += len, ++w) {
      long long r = min(l + len - 1, n - 1LL);
      ans += get_sum(l, r) * w;
      ans %= mod;
    }
    if (ans < 0) ans += mod;
    cout << norm(ans, n) << ' ';
  }
  cout << 0 << endl;
  return 0;
}
