#include <bits/stdc++.h>
const long long mod2 = (long long)998244353;
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << "1 1"
         << "\n";
    cout << -1 * a[0] << "\n";
    cout << "1 1"
         << "\n";
    cout << 0 << "\n";
    cout << "1 1"
         << "\n";
    cout << 0 << "\n";
    return;
  }
  cout << "1 1"
       << "\n";
  cout << n - a[0] << "\n";
  cout << "2 " << n << "\n";
  for (int i = 1; i < n; i++) {
    cout << a[i] * (n - 1) << " ";
  }
  cout << "\n";
  cout << "1 " << n << "\n";
  for (int i = 0; i < n; i++) {
    if (i == 0)
      cout << -1 * n << " ";
    else
      cout << -1 * n * a[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
