#include <bits/stdc++.h>
using namespace std;
int getInt() {
  int s;
  scanf("%d", &s);
  return s;
}
const long long mod = 1000000007;
long long x[100000];
long long f[100000 + 10];
long long rf[100000 + 10];
long long mpow(long long b, long long e) {
  long long ans = 1;
  while (e) {
    if (e % 2 == 1) ans = (ans * b) % mod;
    b = (b * b) % mod;
    e = e / 2;
  }
  return ans;
}
int main() {
  const int n = getInt();
  for (int i = 0; i < (int)(n); i++) x[i] = getInt();
  f[0] = 1;
  for (int i = 0; i < (int)(n); i++) f[i + 1] = f[i] * (i + 1) % mod;
  for (int i = 0; i < (int)(n); i++) cout << f[i] << " ";
  cout << endl;
  long long ans = 0;
  long long acc = 0;
  for (int i = 1; i < n; i++) {
    acc = (acc + mpow(i, mod - 2)) % mod;
    ans = (ans + (x[i] - x[i - 1]) * acc % mod) % mod;
  }
  ans = ans * f[n - 1] % mod;
  printf("%lld\n", ans);
  return 0;
}
