#include <bits/stdc++.h>
using namespace std;
long long bin_pow(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2 == 0) {
    long long t = bin_pow(a, b / 2);
    return t * t % 1000000007;
  } else
    return a * bin_pow(a, b - 1) % 1000000007;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1, n, m, k = 0, x = 0, y = 0, z = 0, sum = 0, l = 0, r = 0,
            ans = 0, mn = LLONG_MAX, mx = LLONG_MIN;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  cout << "1 1\n" << -a[0] << "\n";
  a[0] = 0;
  if (n != 1) {
    cout << "2 " << n << "\n";
    for (int i = 1; i < n; i++) {
      z = abs(a[i]) % n;
      cout << (n - 1) * (abs(a[i]) / a[i]) * z << " ";
      a[i] += (abs(a[i]) / a[i]) * z * (n - 1);
    }
    cout << "\n";
    cout << "1 " << n << "\n";
    for (int i = 0; i < n; i++) cout << -a[i] << " ";
  } else {
    cout << "1 1\n" << 0 << "\n";
    cout << "1 1\n" << 0 << "\n";
  }
  return 0;
}
