#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<long long int> a(n, 0);
  for (int i = 0; i < n; i++) cin >> a[i];
  if (n == 1) {
    for (int i = 0; i < 2; i++) {
      cout << 1 << ' ' << 1 << endl;
      cout << 0 << endl;
    }
    cout << 1 << ' ' << 1 << endl;
    cout << -a[0] << endl;
    return 0;
  }
  cout << 1 << ' ' << n - 1 << endl;
  for (int i = 0; i < n - 1; i++) {
    long long int mod = a[i] % (n);
    if (mod < 0) mod += n;
    if ((n - 1) * mod <= (long long int)(1e18)) {
      cout << (n - 1) * mod << ' ';
      a[i] = (n - 1) * mod + a[i];
    } else if ((n - 1) * (mod - n) >= (long long int)(-1e18)) {
      cout << (n - 1) * (mod - n) << ' ';
      a[i] = (n - 1) * (mod - n) + a[i];
    }
  }
  cout << endl;
  cout << 2 << ' ' << n << endl;
  for (int i = 1; i < n; i++) {
    long long int mod = a[i] % (n);
    if (mod < 0) mod += n;
    if ((n - 1) * mod <= (long long int)(1e18)) {
      cout << (n - 1) * mod << ' ';
      a[i] = (n - 1) * mod + a[i];
    } else if ((n - 1) * (mod - n) >= (long long int)(-1e18)) {
      cout << (n - 1) * (mod - n) << ' ';
      a[i] = (n - 1) * (mod - n) + a[i];
    }
  }
  cout << endl;
  cout << 1 << ' ' << n << endl;
  for (int i = 0; i < n; i++) {
    cout << -a[i] << ' ';
  }
  cout << endl;
}
