#include <bits/stdc++.h>
using namespace std;
void faster() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
const long long INF = 1e9;
const long long MAXN = 1e6;
const long long MOD = 1e9 + 7;
const long long LOG = ceil(log(MAXN) / log(2));
const long double EPS = 1e-9;
const int dx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
const int dy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
long long n, a[MAXN];
void solve() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << 1 << ' ' << 1 << '\n';
    cout << -a[1] << '\n';
    for (int i = 0; i < 2; ++i) {
      cout << 1 << ' ' << 1 << '\n';
      cout << 0 << '\n';
    }
    return;
  }
  cout << 1 << ' ' << n - 1 << '\n';
  for (long long i = 1; i <= n - 1; ++i) {
    long long need = (n - (((a[i] % n) + n) % n)) % n;
    cout << (n - need) * (n - 1) << ' ';
    a[i] += (n - need) * (n - 1);
  }
  cout << '\n';
  cout << 1 << ' ' << n << '\n';
  for (long long i = 1; i <= n; ++i) {
    if (i == n) {
      cout << 0 << ' ';
    } else {
      assert(a[i] % n == 0);
      cout << -a[i] << ' ';
      a[i] -= a[i];
    }
  }
  cout << '\n';
  cout << n << ' ' << n << '\n';
  cout << -a[n] << '\n';
}
int main() {
  faster();
  int T = 1;
  while (T--) {
    solve();
  }
  cerr << "\nTime elapsed " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
  return 0;
}
