#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1e9 + 7;
signed main() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << 1 << " " << 1 << "\n";
    cout << (-1) * (a[0]) << "\n";
    a[0] = 0;
    cout << 1 << " " << 1 << "\n";
    cout << (-1) * (a[0]) << "\n";
    a[0] = 0;
    cout << 1 << " " << 1 << "\n";
    cout << (-1) * (a[0]) << "\n";
    a[0] = 0;
    return 0;
  }
  map<long long, long long> M;
  for (long long i = 0; i < n; i++) {
    long long x = (i * (n - 1)) % n;
    if (M.find(x) == M.end()) {
      M.insert({x, i * (n - 1)});
    }
  }
  cout << 1 << " " << 1 << "\n";
  cout << (-1) * (a[0]) << "\n";
  a[0] = 0;
  cout << 2 << " " << n << "\n";
  for (long long i = 1; i < n; i++) {
    long long mul = 1e9 + 100;
    long long x = a[i] + (n * mul);
    x = (x % n);
    x = (n - x + 2 * n) % n;
    x = M[x];
    cout << x << " ";
    a[i] += x;
  }
  cout << "\n";
  cout << 1 << " " << n << "\n";
  for (long long i = 0; i < n; i++) {
    cout << (-1 * a[i]) << " ";
  }
  cout << "\n";
}
