#include <bits/stdc++.h>
using namespace std;
int n;
const int N = 100100;
long long int a[N];
long long int smanji(int x) {
  int p = x % (n - 1);
  return n - p;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  if (n > 1) {
    cout << 1 << " " << n - 1 << endl;
    for (int i = 0; i < n - 1; i++) {
      cout << (n - 1) * a[i] << " ";
      a[i] += (n - 1) * a[i];
    }
    cout << endl;
    cout << n << " " << n << endl;
    cout << a[n - 1] * -1 << endl;
    a[n - 1] = 0;
    cout << 1 << " " << n << endl;
    for (int i = 0; i < n; i++) {
      cout << a[i] * -1 << " ";
    }
  } else {
    cout << 1 << " " << 1 << endl << a[0] * -1 << endl;
    cout << 1 << " " << 1 << endl
         << 0 << endl
         << 1 << " " << 1 << endl
         << 0 << endl;
  }
  return 0;
}
