#include <bits/stdc++.h>
using namespace std;
void cppio() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
const int maxn = int(2e5) + 10;
int n;
int a[maxn];
int p, q;
long long first, second;
int gcd(int a, int b) {
  if (!b) {
    first = 1, second = 0;
    return a;
  }
  int q = a / b;
  int ret = gcd(b, a % b);
  tie(first, second) = make_pair(second, first - second * q);
  return ret;
}
int ans[maxn][3];
int main() {
  cppio();
  cin >> n;
  for (int i = 1; i <= (n); ++i) cin >> a[i];
  if (n == 1) {
    cout << "1 1\n" << (-a[1]) << "\n1 1\n0\n1 1\n0\n";
    return 0;
  }
  cout << 1 << ' ' << n << "\n0 ";
  for (int i = 2; i <= n; ++i) {
    cout << (-n * 1ll * a[i]) << ' ';
  }
  cout << '\n';
  cout << 1 << ' ' << 1 << '\n';
  cout << (-a[1]) << '\n';
  cout << 2 << ' ' << n << '\n';
  for (int i = 2; i <= n; ++i) {
    int first = a[i];
    cout << ((n - 1) * 1ll * first) << ' ';
  }
  cout << '\n';
  return 0;
}
