#include <bits/stdc++.h>
using namespace std;
void solve();
int main() { solve(); }
void solve() {
  int n;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << 1 << ' ' << 1 << '\n' << 0 << '\n';
    cout << 1 << ' ' << 1 << '\n' << 0 << '\n';
    cout << 1 << ' ' << 1 << '\n' << -a[0];
    return;
  }
  map<int, long long> o;
  long long x = n - 1;
  for (int i = 0; o.find(x % n) == o.end(); i++, x += (n - 1)) {
    o[x % n] = x;
  }
  cout << 1 << ' ' << n - 1 << '\n';
  for (int i = 0; i < n - 1; i++) {
    long long x = o[(n - (a[i] % n)) % n];
    cout << x << ' ';
    a[i] += x;
  }
  cout << '\n';
  cout << 2 << ' ' << n << '\n';
  for (int i = 1; i < n; i++) {
    if (i == n - 1) {
      long long x = o[(n - (a[i] % n)) % n];
      cout << x << ' ';
      a[i] += x;
      continue;
    }
    cout << '0' << ' ';
  }
  cout << '\n';
  cout << 1 << ' ' << n << '\n';
  for (int i = 0; i < n; i++) {
    cout << -a[i] << ' ';
  }
}
