#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using dl = double;
const int N = 2e5 + 10;
ll aarray[200000 + 10];
ll magic[101][101];
vector<ll> primes;
bool prime[1000001];
int main() {
  ios_base::sync_with_stdio(false);
  string str;
  ll i, j, n, m, k, t;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> aarray[i];
  }
  if (n == 1) {
    cout << 1 << " " << 1 << endl;
    cout << 0 << endl;
    cout << 1 << " " << 1 << endl;
    cout << 0 << endl;
    cout << 1 << " " << 1 << endl;
    cout << -aarray[1] << endl;
    return 0;
  }
  cout << 1 << " " << n << endl;
  for (i = 1; i <= n; i++) {
    cout << -(aarray[i] * n) << " ";
  }
  cout << endl;
  cout << 1 << " " << n - 1 << endl;
  for (i = 1; i < n; i++) {
    cout << aarray[i] * (n - 1) << " ";
  }
  cout << endl;
  cout << n << " " << n << endl;
  k = -(aarray[n] * n);
  cout << -(k + aarray[n]) << endl;
  return 0;
}
