#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.1415926535897932384626433;
const int mod = 1000000007;
const long long inf = 1e18;
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << 1 << " " << 1 << "\n"
         << 0 << "\n"
         << 1 << " " << 1 << "\n"
         << 0 << "\n"
         << 1 << " " << 1 << "\n"
         << -a[0] << "\n";
    return;
  }
  cout << 1 << " " << n - 1 << "\n";
  for (long long i = 0; i < n - 1; i++) {
    cout << (n - 1) * (a[i] % n) << " ";
    a[i] += (n - 1) * (a[i] % n);
  }
  cout << "\n";
  cout << n << " " << n << "\n";
  ;
  cout << n - a[n - 1] % n << "\n";
  a[n - 1] += (n - a[n - 1] % n);
  cout << 1 << " " << n << "\n";
  for (long long i = 0; i < n; i++) {
    cout << -a[i] << " ";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
}
