#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long N = 3e5 + 36;
const long long M = 1e0 + 36;
const long long INF = 1e13 + 7;
const long long MOD = 1e9 + 7;
const long long X[4] = {1, -1, 0, 0};
const long long Y[4] = {0, 0, 1, -1};
const double long PI = 3.14159265358979323846;
const double long EPS = 1e-3;
mt19937 gen(19937);
long long a[N];
signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  t = 1;
  while (t--) {
    int n;
    cin >> n;
    for (int i(0); i < n; ++i) {
      cin >> a[i];
    }
    if (n == 1) {
      cout << "1 1" << '\n';
      cout << -a[0] << '\n';
      cout << "1 1" << '\n';
      cout << 0 << '\n';
      cout << "1 1" << '\n';
      cout << 0 << '\n';
      return 0;
    }
    cout << 1 << ' ' << 1 << '\n';
    cout << -a[0] << '\n';
    a[0] = 0;
    cout << 1 << ' ' << n << '\n';
    long long x = n;
    for (int i(0); i < n; ++i) {
      if (a[i] == 0) {
        cout << 0 << ' ';
      } else {
        long long y = (x - 1) - (a[i] % (x - 1));
        cout << x * y << ' ';
        a[i] += x * y;
      }
    }
    cout << '\n';
    cout << 2 << ' ' << n << '\n';
    for (int i(1); i < n; ++i) {
      cout << -a[i] << ' ';
    }
  }
  return 0;
}
