#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
const int M = 998244353;
bool seen[N];
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<long long int> ans(n);
  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';
  } else {
    cout << 1 << ' ' << n - 1 << '\n';
    for (int i = 0; i < n - 1; i++) {
      ans[i] = a[i] + (n - 1) * (a[i] % n);
      cout << (n - 1) * (a[i] % n) << ' ';
    }
    cout << '\n';
    cout << n << ' ' << n << '\n';
    cout << -(a[n - 1] % n) << '\n';
    ans[n - 1] = a[n - 1] - a[n - 1] % n;
    cout << 1 << ' ' << n << '\n';
    for (int i = 0; i < n; i++) cout << -ans[i] << ' ';
  }
  return 0;
}
