#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long a[100005];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%lld", a + i);
  if (n > 1) {
    cout << 1 << ' ' << n - 1 << endl;
    for (int i = 1; i <= n - 1; i++) {
      long long rem = a[i] % n;
      printf("%lld ", rem * (n - 1));
      a[i] += rem * (n - 1);
    }
    cout << endl << n << ' ' << n << endl;
    cout << -(a[n] % n) << endl;
    cout << 1 << ' ' << n << endl;
    a[n] -= a[n] % n;
    for (int i = 1; i <= n; i++) {
      printf("%lld ", -a[i]);
    }
  } else {
    cout << "1 1" << endl << -a[1] << endl << "1 1\n0\n1 1\n0\n";
  }
}
